./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/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_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 18:19:18,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:19:18,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:19:18,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:19:18,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:19:18,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:19:18,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:19:18,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:19:18,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:19:18,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:19:18,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:19:18,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:19:18,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:19:18,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:19:18,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:19:18,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:19:18,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:19:18,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:19:18,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:19:18,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:19:18,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:19:18,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:19:18,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:19:18,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:19:18,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:19:18,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:19:18,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:19:18,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:19:18,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:19:18,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:19:18,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:19:18,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:19:18,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:19:18,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:19:18,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:19:18,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:19:18,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:19:18,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:19:18,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:19:18,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:19:18,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:19:18,515 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 18:19:18,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:19:18,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:19:18,537 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:19:18,537 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:19:18,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:19:18,538 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:19:18,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:19:18,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:19:18,539 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:19:18,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:19:18,539 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:19:18,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:19:18,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:19:18,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:19:18,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:19:18,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:19:18,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:19:18,540 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:19:18,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:19:18,540 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:19:18,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:19:18,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:19:18,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:19:18,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:19:18,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:19:18,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:19:18,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:19:18,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:19:18,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:19:18,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:19:18,541 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:19:18,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:19:18,541 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:19:18,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:19:18,542 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:19:18,542 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 [2022-12-13 18:19:18,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:19:18,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:19:18,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:19:18,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:19:18,752 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:19:18,753 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2022-12-13 18:19:21,375 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:19:21,505 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:19:21,506 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2022-12-13 18:19:21,513 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/data/c936a02d6/ec110707ad8d4e878ae6f32e115b9a77/FLAG8e8ae12dc [2022-12-13 18:19:21,524 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/data/c936a02d6/ec110707ad8d4e878ae6f32e115b9a77 [2022-12-13 18:19:21,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:19:21,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:19:21,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:19:21,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:19:21,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:19:21,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7197ee87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21, skipping insertion in model container [2022-12-13 18:19:21,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:19:21,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:19:21,662 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[911,924] [2022-12-13 18:19:21,707 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[8416,8429] [2022-12-13 18:19:21,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:19:21,748 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:19:21,757 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[911,924] [2022-12-13 18:19:21,773 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[8416,8429] [2022-12-13 18:19:21,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:19:21,813 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:19:21,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21 WrapperNode [2022-12-13 18:19:21,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:19:21,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:19:21,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:19:21,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:19:21,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,861 INFO L138 Inliner]: procedures = 61, calls = 71, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 561 [2022-12-13 18:19:21,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:19:21,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:19:21,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:19:21,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:19:21,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,891 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:19:21,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:19:21,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:19:21,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:19:21,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21" (1/1) ... [2022-12-13 18:19:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:19:21,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:19:21,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:19:21,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:19:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:19:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 18:19:21,953 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 18:19:21,954 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-13 18:19:21,954 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-13 18:19:21,954 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-13 18:19:21,954 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-13 18:19:21,954 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-13 18:19:21,954 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-13 18:19:21,955 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-12-13 18:19:21,955 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-12-13 18:19:21,955 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-13 18:19:21,955 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-13 18:19:21,955 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-13 18:19:21,955 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-13 18:19:21,955 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-12-13 18:19:21,956 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-12-13 18:19:21,956 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-13 18:19:21,956 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-13 18:19:21,956 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-12-13 18:19:21,956 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-12-13 18:19:21,956 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-13 18:19:21,956 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-13 18:19:21,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:19:21,957 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-13 18:19:21,957 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-13 18:19:21,957 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-12-13 18:19:21,957 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-12-13 18:19:21,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:19:21,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:19:21,957 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-13 18:19:21,958 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-13 18:19:21,958 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-12-13 18:19:21,958 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-12-13 18:19:22,036 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:19:22,038 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:19:22,438 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-12-13 18:19:22,439 INFO L769 $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; [2022-12-13 18:19:22,478 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:19:22,484 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:19:22,484 INFO L300 CfgBuilder]: Removed 10 assume(true) statements. [2022-12-13 18:19:22,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:19:22 BoogieIcfgContainer [2022-12-13 18:19:22,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:19:22,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:19:22,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:19:22,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:19:22,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:19:21" (1/3) ... [2022-12-13 18:19:22,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aabfffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:19:22, skipping insertion in model container [2022-12-13 18:19:22,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:19:21" (2/3) ... [2022-12-13 18:19:22,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aabfffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:19:22, skipping insertion in model container [2022-12-13 18:19:22,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:19:22" (3/3) ... [2022-12-13 18:19:22,492 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-1.c [2022-12-13 18:19:22,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:19:22,506 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 18:19:22,547 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:19:22,552 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@37720854, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:19:22,552 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 18:19:22,556 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) [2022-12-13 18:19:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 18:19:22,564 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:22,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:22,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:22,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:22,570 INFO L85 PathProgramCache]: Analyzing trace with hash 806435038, now seen corresponding path program 1 times [2022-12-13 18:19:22,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:22,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953620373] [2022-12-13 18:19:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:22,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:22,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:22,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:19:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:22,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:19:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:22,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:19:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:22,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:19:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:22,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:19:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:19:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:22,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953620373] [2022-12-13 18:19:22,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953620373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:22,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:22,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:19:22,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212536755] [2022-12-13 18:19:22,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:22,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:19:22,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:22,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:19:22,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:19:22,977 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) [2022-12-13 18:19:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:23,783 INFO L93 Difference]: Finished difference Result 695 states and 1069 transitions. [2022-12-13 18:19:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 18:19:23,785 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 [2022-12-13 18:19:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:23,794 INFO L225 Difference]: With dead ends: 695 [2022-12-13 18:19:23,794 INFO L226 Difference]: Without dead ends: 422 [2022-12-13 18:19:23,812 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:19:23,815 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 744 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:23,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1039 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 18:19:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-12-13 18:19:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 383. [2022-12-13 18:19:23,886 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) [2022-12-13 18:19:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 554 transitions. [2022-12-13 18:19:23,889 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 554 transitions. Word has length 65 [2022-12-13 18:19:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:23,890 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 554 transitions. [2022-12-13 18:19:23,890 INFO L496 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) [2022-12-13 18:19:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 554 transitions. [2022-12-13 18:19:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 18:19:23,892 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:23,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:23,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:19:23,893 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:23,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:23,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1809643618, now seen corresponding path program 1 times [2022-12-13 18:19:23,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:23,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683630850] [2022-12-13 18:19:23,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:23,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:23,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:19:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:24,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:19:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:24,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:19:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:24,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:19:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:24,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:19:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:24,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:19:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:24,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:24,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683630850] [2022-12-13 18:19:24,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683630850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:24,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:24,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:19:24,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005194868] [2022-12-13 18:19:24,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:24,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:19:24,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:24,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:19:24,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:19:24,051 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) [2022-12-13 18:19:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:25,003 INFO L93 Difference]: Finished difference Result 780 states and 1120 transitions. [2022-12-13 18:19:25,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 18:19:25,004 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 [2022-12-13 18:19:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:25,007 INFO L225 Difference]: With dead ends: 780 [2022-12-13 18:19:25,007 INFO L226 Difference]: Without dead ends: 571 [2022-12-13 18:19:25,008 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:19:25,009 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 757 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:25,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1569 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 18:19:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-12-13 18:19:25,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 495. [2022-12-13 18:19:25,042 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) [2022-12-13 18:19:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 714 transitions. [2022-12-13 18:19:25,045 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 714 transitions. Word has length 65 [2022-12-13 18:19:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:25,045 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 714 transitions. [2022-12-13 18:19:25,045 INFO L496 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) [2022-12-13 18:19:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 714 transitions. [2022-12-13 18:19:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 18:19:25,047 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:25,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:25,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:19:25,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:25,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:25,048 INFO L85 PathProgramCache]: Analyzing trace with hash 456737568, now seen corresponding path program 1 times [2022-12-13 18:19:25,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:25,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957106462] [2022-12-13 18:19:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:25,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:25,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:19:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:25,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:19:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:25,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:19:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:25,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:19:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:25,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 18:19:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:25,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 18:19:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:25,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:25,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957106462] [2022-12-13 18:19:25,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957106462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:25,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:25,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 18:19:25,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293117750] [2022-12-13 18:19:25,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:25,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:19:25,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:25,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:19:25,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:19:25,177 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) [2022-12-13 18:19:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:26,793 INFO L93 Difference]: Finished difference Result 2041 states and 2912 transitions. [2022-12-13 18:19:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 18:19:26,794 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 [2022-12-13 18:19:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:26,803 INFO L225 Difference]: With dead ends: 2041 [2022-12-13 18:19:26,803 INFO L226 Difference]: Without dead ends: 1708 [2022-12-13 18:19:26,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 18:19:26,806 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 2358 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 2416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:26,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 1897 Invalid, 2416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 1867 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-13 18:19:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2022-12-13 18:19:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1548. [2022-12-13 18:19:26,874 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) [2022-12-13 18:19:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2101 transitions. [2022-12-13 18:19:26,879 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2101 transitions. Word has length 65 [2022-12-13 18:19:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:26,879 INFO L495 AbstractCegarLoop]: Abstraction has 1548 states and 2101 transitions. [2022-12-13 18:19:26,879 INFO L496 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) [2022-12-13 18:19:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2101 transitions. [2022-12-13 18:19:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 18:19:26,881 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:26,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:26,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:19:26,881 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:26,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1523190705, now seen corresponding path program 1 times [2022-12-13 18:19:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:26,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54301353] [2022-12-13 18:19:26,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:26,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:26,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:26,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:19:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:26,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:19:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:26,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:19:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:27,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 18:19:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 18:19:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:27,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 18:19:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:27,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:27,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54301353] [2022-12-13 18:19:27,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54301353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:27,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:27,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 18:19:27,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609777397] [2022-12-13 18:19:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:27,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:19:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:27,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:19:27,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:19:27,020 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) [2022-12-13 18:19:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:27,818 INFO L93 Difference]: Finished difference Result 3076 states and 4180 transitions. [2022-12-13 18:19:27,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:19:27,818 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 [2022-12-13 18:19:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:27,830 INFO L225 Difference]: With dead ends: 3076 [2022-12-13 18:19:27,830 INFO L226 Difference]: Without dead ends: 1696 [2022-12-13 18:19:27,835 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:19:27,836 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 315 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:27,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1629 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 18:19:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2022-12-13 18:19:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1588. [2022-12-13 18:19:27,947 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) [2022-12-13 18:19:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2135 transitions. [2022-12-13 18:19:27,952 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2135 transitions. Word has length 66 [2022-12-13 18:19:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:27,952 INFO L495 AbstractCegarLoop]: Abstraction has 1588 states and 2135 transitions. [2022-12-13 18:19:27,953 INFO L496 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) [2022-12-13 18:19:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2135 transitions. [2022-12-13 18:19:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 18:19:27,953 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:27,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:27,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:19:27,954 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:27,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:27,954 INFO L85 PathProgramCache]: Analyzing trace with hash 493831407, now seen corresponding path program 1 times [2022-12-13 18:19:27,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:27,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796257938] [2022-12-13 18:19:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:27,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:28,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:28,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:19:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:28,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:19:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:28,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:19:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:28,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 18:19:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:28,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 18:19:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:28,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 18:19:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:28,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:28,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796257938] [2022-12-13 18:19:28,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796257938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:28,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:28,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 18:19:28,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002318738] [2022-12-13 18:19:28,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:28,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:19:28,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:28,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:19:28,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:19:28,061 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) [2022-12-13 18:19:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:29,639 INFO L93 Difference]: Finished difference Result 5160 states and 7009 transitions. [2022-12-13 18:19:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 18:19:29,639 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 [2022-12-13 18:19:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:29,648 INFO L225 Difference]: With dead ends: 5160 [2022-12-13 18:19:29,648 INFO L226 Difference]: Without dead ends: 1979 [2022-12-13 18:19:29,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 18:19:29,653 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 2703 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2721 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 645 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:29,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2721 Valid, 1677 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [645 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 18:19:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2022-12-13 18:19:29,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1799. [2022-12-13 18:19:29,771 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) [2022-12-13 18:19:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2347 transitions. [2022-12-13 18:19:29,778 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2347 transitions. Word has length 66 [2022-12-13 18:19:29,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:29,778 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 2347 transitions. [2022-12-13 18:19:29,779 INFO L496 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) [2022-12-13 18:19:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2347 transitions. [2022-12-13 18:19:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:19:29,780 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:29,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:29,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:19:29,781 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:29,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:29,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1802213968, now seen corresponding path program 1 times [2022-12-13 18:19:29,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:29,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699596237] [2022-12-13 18:19:29,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:29,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:29,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:19:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:29,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:19:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:29,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:19:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:29,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:29,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699596237] [2022-12-13 18:19:29,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699596237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:29,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:29,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:19:29,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791061046] [2022-12-13 18:19:29,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:29,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:19:29,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:29,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:19:29,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:19:29,847 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) [2022-12-13 18:19:30,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:30,374 INFO L93 Difference]: Finished difference Result 1993 states and 2647 transitions. [2022-12-13 18:19:30,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:19:30,375 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 [2022-12-13 18:19:30,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:30,380 INFO L225 Difference]: With dead ends: 1993 [2022-12-13 18:19:30,380 INFO L226 Difference]: Without dead ends: 1842 [2022-12-13 18:19:30,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:19:30,382 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 483 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:30,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 621 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 18:19:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2022-12-13 18:19:30,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1799. [2022-12-13 18:19:30,539 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) [2022-12-13 18:19:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2346 transitions. [2022-12-13 18:19:30,545 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2346 transitions. Word has length 80 [2022-12-13 18:19:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:30,546 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 2346 transitions. [2022-12-13 18:19:30,546 INFO L496 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) [2022-12-13 18:19:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2346 transitions. [2022-12-13 18:19:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:19:30,547 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:30,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:30,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 18:19:30,548 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash -106243822, now seen corresponding path program 1 times [2022-12-13 18:19:30,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:30,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029546097] [2022-12-13 18:19:30,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:30,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:30,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:30,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:19:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:19:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:30,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:19:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:30,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:30,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:30,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029546097] [2022-12-13 18:19:30,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029546097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:30,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:30,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:19:30,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107986813] [2022-12-13 18:19:30,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:30,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:19:30,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:30,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:19:30,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:19:30,635 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) [2022-12-13 18:19:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:31,460 INFO L93 Difference]: Finished difference Result 2181 states and 2937 transitions. [2022-12-13 18:19:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 18:19:31,461 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 [2022-12-13 18:19:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:31,466 INFO L225 Difference]: With dead ends: 2181 [2022-12-13 18:19:31,466 INFO L226 Difference]: Without dead ends: 2033 [2022-12-13 18:19:31,467 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:19:31,467 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 786 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:31,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 842 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 18:19:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2022-12-13 18:19:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 1946. [2022-12-13 18:19:31,586 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) [2022-12-13 18:19:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2570 transitions. [2022-12-13 18:19:31,590 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2570 transitions. Word has length 80 [2022-12-13 18:19:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:31,590 INFO L495 AbstractCegarLoop]: Abstraction has 1946 states and 2570 transitions. [2022-12-13 18:19:31,590 INFO L496 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) [2022-12-13 18:19:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2570 transitions. [2022-12-13 18:19:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:19:31,591 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:31,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:31,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:19:31,592 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:31,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1347684338, now seen corresponding path program 1 times [2022-12-13 18:19:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:31,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115156633] [2022-12-13 18:19:31,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:31,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:31,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:19:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:31,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:19:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:31,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:19:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:31,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:31,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:31,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115156633] [2022-12-13 18:19:31,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115156633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:31,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:31,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:19:31,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617501690] [2022-12-13 18:19:31,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:31,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:19:31,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:31,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:19:31,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:19:31,679 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) [2022-12-13 18:19:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:32,737 INFO L93 Difference]: Finished difference Result 2519 states and 3450 transitions. [2022-12-13 18:19:32,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 18:19:32,737 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 [2022-12-13 18:19:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:32,742 INFO L225 Difference]: With dead ends: 2519 [2022-12-13 18:19:32,742 INFO L226 Difference]: Without dead ends: 2224 [2022-12-13 18:19:32,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:19:32,743 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 781 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:32,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1381 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 18:19:32,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2022-12-13 18:19:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2084. [2022-12-13 18:19:32,872 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) [2022-12-13 18:19:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2775 transitions. [2022-12-13 18:19:32,876 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2775 transitions. Word has length 80 [2022-12-13 18:19:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:32,876 INFO L495 AbstractCegarLoop]: Abstraction has 2084 states and 2775 transitions. [2022-12-13 18:19:32,876 INFO L496 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) [2022-12-13 18:19:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2775 transitions. [2022-12-13 18:19:32,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:19:32,877 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:32,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:32,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 18:19:32,878 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:32,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:32,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1261103120, now seen corresponding path program 1 times [2022-12-13 18:19:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:32,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037458470] [2022-12-13 18:19:32,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:32,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:32,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:32,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:19:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:32,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:19:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:32,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:19:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:32,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:32,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:32,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037458470] [2022-12-13 18:19:32,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037458470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:32,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:32,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:19:32,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092017820] [2022-12-13 18:19:32,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:32,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:19:32,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:32,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:19:32,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:19:32,966 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) [2022-12-13 18:19:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:33,932 INFO L93 Difference]: Finished difference Result 3016 states and 4203 transitions. [2022-12-13 18:19:33,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 18:19:33,932 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 [2022-12-13 18:19:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:33,942 INFO L225 Difference]: With dead ends: 3016 [2022-12-13 18:19:33,942 INFO L226 Difference]: Without dead ends: 2583 [2022-12-13 18:19:33,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:19:33,945 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 779 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:33,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1379 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 18:19:33,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2022-12-13 18:19:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2361. [2022-12-13 18:19:34,143 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) [2022-12-13 18:19:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 3190 transitions. [2022-12-13 18:19:34,150 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 3190 transitions. Word has length 80 [2022-12-13 18:19:34,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:34,150 INFO L495 AbstractCegarLoop]: Abstraction has 2361 states and 3190 transitions. [2022-12-13 18:19:34,151 INFO L496 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) [2022-12-13 18:19:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 3190 transitions. [2022-12-13 18:19:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:19:34,153 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:34,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:34,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 18:19:34,154 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:34,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1206710222, now seen corresponding path program 1 times [2022-12-13 18:19:34,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:34,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029654562] [2022-12-13 18:19:34,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:34,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:34,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:34,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:19:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:34,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:19:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:34,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:19:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:34,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:34,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:34,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029654562] [2022-12-13 18:19:34,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029654562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:34,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:34,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:19:34,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130935398] [2022-12-13 18:19:34,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:34,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:19:34,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:34,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:19:34,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:19:34,264 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) [2022-12-13 18:19:35,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:35,294 INFO L93 Difference]: Finished difference Result 3977 states and 5658 transitions. [2022-12-13 18:19:35,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 18:19:35,295 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 [2022-12-13 18:19:35,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:35,302 INFO L225 Difference]: With dead ends: 3977 [2022-12-13 18:19:35,302 INFO L226 Difference]: Without dead ends: 3267 [2022-12-13 18:19:35,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 18:19:35,305 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 822 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:35,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1038 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 18:19:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3267 states. [2022-12-13 18:19:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3267 to 2916. [2022-12-13 18:19:35,489 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) [2022-12-13 18:19:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4026 transitions. [2022-12-13 18:19:35,495 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4026 transitions. Word has length 80 [2022-12-13 18:19:35,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:35,495 INFO L495 AbstractCegarLoop]: Abstraction has 2916 states and 4026 transitions. [2022-12-13 18:19:35,496 INFO L496 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) [2022-12-13 18:19:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4026 transitions. [2022-12-13 18:19:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:19:35,497 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:35,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:35,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 18:19:35,498 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:35,498 INFO L85 PathProgramCache]: Analyzing trace with hash 789313616, now seen corresponding path program 1 times [2022-12-13 18:19:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:35,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012661353] [2022-12-13 18:19:35,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:35,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:35,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:19:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:35,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:19:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:35,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:19:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:35,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:35,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:35,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012661353] [2022-12-13 18:19:35,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012661353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:35,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:35,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:19:35,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363848010] [2022-12-13 18:19:35,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:35,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:19:35,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:35,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:19:35,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:19:35,581 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) [2022-12-13 18:19:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:36,440 INFO L93 Difference]: Finished difference Result 4527 states and 6511 transitions. [2022-12-13 18:19:36,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:19:36,441 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 [2022-12-13 18:19:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:36,455 INFO L225 Difference]: With dead ends: 4527 [2022-12-13 18:19:36,455 INFO L226 Difference]: Without dead ends: 3262 [2022-12-13 18:19:36,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:19:36,459 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 769 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:36,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 698 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 18:19:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2022-12-13 18:19:36,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2916. [2022-12-13 18:19:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2385 states have (on average 1.3928721174004193) internal successors, (3322), 2419 states have internal predecessors, (3322), 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) [2022-12-13 18:19:36,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4017 transitions. [2022-12-13 18:19:36,642 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4017 transitions. Word has length 80 [2022-12-13 18:19:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:36,642 INFO L495 AbstractCegarLoop]: Abstraction has 2916 states and 4017 transitions. [2022-12-13 18:19:36,642 INFO L496 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) [2022-12-13 18:19:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4017 transitions. [2022-12-13 18:19:36,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:19:36,644 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:36,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:36,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 18:19:36,645 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:36,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:36,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1468585870, now seen corresponding path program 1 times [2022-12-13 18:19:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:36,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864527756] [2022-12-13 18:19:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:36,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:36,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:19:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:36,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:19:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:36,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:19:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:36,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:36,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:36,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864527756] [2022-12-13 18:19:36,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864527756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:36,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:36,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:19:36,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440302235] [2022-12-13 18:19:36,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:36,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:19:36,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:36,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:19:36,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:19:36,736 INFO L87 Difference]: Start difference. First operand 2916 states and 4017 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) [2022-12-13 18:19:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:38,012 INFO L93 Difference]: Finished difference Result 6199 states and 8978 transitions. [2022-12-13 18:19:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 18:19:38,013 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 [2022-12-13 18:19:38,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:38,024 INFO L225 Difference]: With dead ends: 6199 [2022-12-13 18:19:38,024 INFO L226 Difference]: Without dead ends: 4934 [2022-12-13 18:19:38,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 18:19:38,027 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 864 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:38,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1365 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 18:19:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2022-12-13 18:19:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 3935. [2022-12-13 18:19:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3935 states, 3260 states have (on average 1.4125766871165644) internal successors, (4605), 3302 states have internal predecessors, (4605), 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) [2022-12-13 18:19:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 5538 transitions. [2022-12-13 18:19:38,449 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 5538 transitions. Word has length 80 [2022-12-13 18:19:38,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:38,450 INFO L495 AbstractCegarLoop]: Abstraction has 3935 states and 5538 transitions. [2022-12-13 18:19:38,450 INFO L496 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) [2022-12-13 18:19:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 5538 transitions. [2022-12-13 18:19:38,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:19:38,452 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:38,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:38,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 18:19:38,452 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:38,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:38,452 INFO L85 PathProgramCache]: Analyzing trace with hash -864806768, now seen corresponding path program 1 times [2022-12-13 18:19:38,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:38,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377329371] [2022-12-13 18:19:38,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:38,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:38,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:19:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:38,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:19:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:19:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:38,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:38,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377329371] [2022-12-13 18:19:38,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377329371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:38,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:38,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:19:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100877019] [2022-12-13 18:19:38,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:38,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:19:38,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:38,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:19:38,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:19:38,537 INFO L87 Difference]: Start difference. First operand 3935 states and 5538 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) [2022-12-13 18:19:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:40,126 INFO L93 Difference]: Finished difference Result 9592 states and 14085 transitions. [2022-12-13 18:19:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 18:19:40,126 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 [2022-12-13 18:19:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:40,149 INFO L225 Difference]: With dead ends: 9592 [2022-12-13 18:19:40,149 INFO L226 Difference]: Without dead ends: 7308 [2022-12-13 18:19:40,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 18:19:40,155 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 780 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:40,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1369 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 18:19:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7308 states. [2022-12-13 18:19:40,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7308 to 6058. [2022-12-13 18:19:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6058 states, 5103 states have (on average 1.4401332549480697) internal successors, (7349), 5161 states have internal predecessors, (7349), 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) [2022-12-13 18:19:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6058 states to 6058 states and 8796 transitions. [2022-12-13 18:19:40,612 INFO L78 Accepts]: Start accepts. Automaton has 6058 states and 8796 transitions. Word has length 80 [2022-12-13 18:19:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:40,612 INFO L495 AbstractCegarLoop]: Abstraction has 6058 states and 8796 transitions. [2022-12-13 18:19:40,613 INFO L496 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) [2022-12-13 18:19:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 6058 states and 8796 transitions. [2022-12-13 18:19:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:19:40,616 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:40,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:40,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 18:19:40,616 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:40,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash -304106990, now seen corresponding path program 1 times [2022-12-13 18:19:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:40,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275386558] [2022-12-13 18:19:40,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:40,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:40,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:19:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:40,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:19:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:40,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:19:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:40,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:40,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275386558] [2022-12-13 18:19:40,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275386558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:40,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:40,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:19:40,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836842176] [2022-12-13 18:19:40,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:40,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:19:40,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:40,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:19:40,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:19:40,703 INFO L87 Difference]: Start difference. First operand 6058 states and 8796 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) [2022-12-13 18:19:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:42,451 INFO L93 Difference]: Finished difference Result 13338 states and 19796 transitions. [2022-12-13 18:19:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:19:42,451 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 [2022-12-13 18:19:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:42,475 INFO L225 Difference]: With dead ends: 13338 [2022-12-13 18:19:42,475 INFO L226 Difference]: Without dead ends: 8932 [2022-12-13 18:19:42,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 18:19:42,483 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 476 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:42,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1165 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 18:19:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8932 states. [2022-12-13 18:19:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8932 to 6157. [2022-12-13 18:19:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6157 states, 5202 states have (on average 1.431757016532103) internal successors, (7448), 5260 states have internal predecessors, (7448), 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) [2022-12-13 18:19:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6157 states to 6157 states and 8895 transitions. [2022-12-13 18:19:42,949 INFO L78 Accepts]: Start accepts. Automaton has 6157 states and 8895 transitions. Word has length 80 [2022-12-13 18:19:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:42,949 INFO L495 AbstractCegarLoop]: Abstraction has 6157 states and 8895 transitions. [2022-12-13 18:19:42,949 INFO L496 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) [2022-12-13 18:19:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 6157 states and 8895 transitions. [2022-12-13 18:19:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 18:19:42,952 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:42,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:19:42,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 18:19:42,952 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:42,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:42,952 INFO L85 PathProgramCache]: Analyzing trace with hash -785187248, now seen corresponding path program 1 times [2022-12-13 18:19:42,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:42,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826122440] [2022-12-13 18:19:42,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:42,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:42,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:42,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:19:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:42,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:19:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:43,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:19:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:43,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:19:43,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:43,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826122440] [2022-12-13 18:19:43,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826122440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:43,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:43,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:19:43,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460268602] [2022-12-13 18:19:43,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:43,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:19:43,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:43,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:19:43,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:19:43,056 INFO L87 Difference]: Start difference. First operand 6157 states and 8895 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) [2022-12-13 18:19:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:45,961 INFO L93 Difference]: Finished difference Result 21459 states and 32552 transitions. [2022-12-13 18:19:45,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 18:19:45,961 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 [2022-12-13 18:19:45,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:45,997 INFO L225 Difference]: With dead ends: 21459 [2022-12-13 18:19:45,997 INFO L226 Difference]: Without dead ends: 16954 [2022-12-13 18:19:46,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-13 18:19:46,009 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 1597 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:46,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 1159 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-13 18:19:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16954 states. [2022-12-13 18:19:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16954 to 14387. [2022-12-13 18:19:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14387 states, 12257 states have (on average 1.4414620217018845) internal successors, (17668), 12430 states have internal predecessors, (17668), 1272 states have call successors, (1272), 734 states have call predecessors, (1272), 856 states have return successors, (2269), 1256 states have call predecessors, (2269), 1268 states have call successors, (2269) [2022-12-13 18:19:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14387 states to 14387 states and 21209 transitions. [2022-12-13 18:19:47,311 INFO L78 Accepts]: Start accepts. Automaton has 14387 states and 21209 transitions. Word has length 80 [2022-12-13 18:19:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:47,311 INFO L495 AbstractCegarLoop]: Abstraction has 14387 states and 21209 transitions. [2022-12-13 18:19:47,311 INFO L496 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) [2022-12-13 18:19:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 14387 states and 21209 transitions. [2022-12-13 18:19:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 18:19:47,316 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:47,317 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:19:47,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 18:19:47,317 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:47,317 INFO L85 PathProgramCache]: Analyzing trace with hash 658635861, now seen corresponding path program 1 times [2022-12-13 18:19:47,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:47,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945356761] [2022-12-13 18:19:47,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:19:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:47,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:19:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:47,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:19:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:47,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 18:19:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:47,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 18:19:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:47,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 18:19:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:47,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:47,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 18:19:47,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:47,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945356761] [2022-12-13 18:19:47,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945356761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:47,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:47,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 18:19:47,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050033891] [2022-12-13 18:19:47,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:47,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:19:47,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:47,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:19:47,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:19:47,416 INFO L87 Difference]: Start difference. First operand 14387 states and 21209 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) [2022-12-13 18:19:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:49,177 INFO L93 Difference]: Finished difference Result 16212 states and 23611 transitions. [2022-12-13 18:19:49,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 18:19:49,178 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 [2022-12-13 18:19:49,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:49,209 INFO L225 Difference]: With dead ends: 16212 [2022-12-13 18:19:49,209 INFO L226 Difference]: Without dead ends: 14581 [2022-12-13 18:19:49,215 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:19:49,216 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 309 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:49,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1572 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 18:19:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14581 states. [2022-12-13 18:19:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14581 to 14447. [2022-12-13 18:19:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14447 states, 12305 states have (on average 1.439252336448598) internal successors, (17710), 12478 states have internal predecessors, (17710), 1272 states have call successors, (1272), 734 states have call predecessors, (1272), 868 states have return successors, (2281), 1268 states have call predecessors, (2281), 1268 states have call successors, (2281) [2022-12-13 18:19:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14447 states to 14447 states and 21263 transitions. [2022-12-13 18:19:50,399 INFO L78 Accepts]: Start accepts. Automaton has 14447 states and 21263 transitions. Word has length 91 [2022-12-13 18:19:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:50,399 INFO L495 AbstractCegarLoop]: Abstraction has 14447 states and 21263 transitions. [2022-12-13 18:19:50,399 INFO L496 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) [2022-12-13 18:19:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 14447 states and 21263 transitions. [2022-12-13 18:19:50,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 18:19:50,403 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:50,404 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:19:50,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 18:19:50,404 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:50,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:50,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1102536535, now seen corresponding path program 1 times [2022-12-13 18:19:50,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:50,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482083110] [2022-12-13 18:19:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:50,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:50,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:19:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:50,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:19:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:50,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:19:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:50,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 18:19:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 18:19:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:50,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 18:19:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:50,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 18:19:50,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:50,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482083110] [2022-12-13 18:19:50,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482083110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:50,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:50,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:19:50,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550588864] [2022-12-13 18:19:50,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:50,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:19:50,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:50,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:19:50,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:19:50,511 INFO L87 Difference]: Start difference. First operand 14447 states and 21263 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) [2022-12-13 18:19:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:52,624 INFO L93 Difference]: Finished difference Result 15974 states and 23227 transitions. [2022-12-13 18:19:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 18:19:52,625 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 [2022-12-13 18:19:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:52,655 INFO L225 Difference]: With dead ends: 15974 [2022-12-13 18:19:52,655 INFO L226 Difference]: Without dead ends: 14521 [2022-12-13 18:19:52,663 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:19:52,664 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 940 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:52,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 1069 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 18:19:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14521 states. [2022-12-13 18:19:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14521 to 14226. [2022-12-13 18:19:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14226 states, 12137 states have (on average 1.4412128203015573) internal successors, (17492), 12305 states have internal predecessors, (17492), 1244 states have call successors, (1244), 715 states have call predecessors, (1244), 843 states have return successors, (2241), 1238 states have call predecessors, (2241), 1240 states have call successors, (2241) [2022-12-13 18:19:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14226 states to 14226 states and 20977 transitions. [2022-12-13 18:19:53,794 INFO L78 Accepts]: Start accepts. Automaton has 14226 states and 20977 transitions. Word has length 91 [2022-12-13 18:19:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:53,794 INFO L495 AbstractCegarLoop]: Abstraction has 14226 states and 20977 transitions. [2022-12-13 18:19:53,794 INFO L496 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) [2022-12-13 18:19:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 14226 states and 20977 transitions. [2022-12-13 18:19:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 18:19:53,799 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:53,799 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:19:53,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 18:19:53,799 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1253268715, now seen corresponding path program 1 times [2022-12-13 18:19:53,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:53,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446343837] [2022-12-13 18:19:53,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:53,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:53,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:53,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:19:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:53,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:19:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:53,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:19:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:53,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 18:19:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:53,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 18:19:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 18:19:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:53,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 18:19:53,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:53,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446343837] [2022-12-13 18:19:53,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446343837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:53,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:53,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:19:53,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274232002] [2022-12-13 18:19:53,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:53,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:19:53,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:53,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:19:53,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:19:53,875 INFO L87 Difference]: Start difference. First operand 14226 states and 20977 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) [2022-12-13 18:19:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:55,753 INFO L93 Difference]: Finished difference Result 17378 states and 25089 transitions. [2022-12-13 18:19:55,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 18:19:55,753 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 [2022-12-13 18:19:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:55,784 INFO L225 Difference]: With dead ends: 17378 [2022-12-13 18:19:55,785 INFO L226 Difference]: Without dead ends: 15909 [2022-12-13 18:19:55,792 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:19:55,792 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 1035 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:55,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 660 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 18:19:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15909 states. [2022-12-13 18:19:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15909 to 15695. [2022-12-13 18:19:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15695 states, 13286 states have (on average 1.4240553966581364) internal successors, (18920), 13483 states have internal predecessors, (18920), 1405 states have call successors, (1405), 828 states have call predecessors, (1405), 1002 states have return successors, (2524), 1417 states have call predecessors, (2524), 1401 states have call successors, (2524) [2022-12-13 18:19:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15695 states to 15695 states and 22849 transitions. [2022-12-13 18:19:57,227 INFO L78 Accepts]: Start accepts. Automaton has 15695 states and 22849 transitions. Word has length 91 [2022-12-13 18:19:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:57,227 INFO L495 AbstractCegarLoop]: Abstraction has 15695 states and 22849 transitions. [2022-12-13 18:19:57,227 INFO L496 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) [2022-12-13 18:19:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 15695 states and 22849 transitions. [2022-12-13 18:19:57,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 18:19:57,231 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:57,232 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:19:57,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 18:19:57,232 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:57,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1983860503, now seen corresponding path program 1 times [2022-12-13 18:19:57,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:57,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093885600] [2022-12-13 18:19:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:57,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:57,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:19:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:57,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:19:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:19:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:57,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 18:19:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:57,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 18:19:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:57,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 18:19:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:57,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:19:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 18:19:57,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:57,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093885600] [2022-12-13 18:19:57,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093885600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:57,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:57,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:19:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511223793] [2022-12-13 18:19:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:57,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:19:57,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:57,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:19:57,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:19:57,279 INFO L87 Difference]: Start difference. First operand 15695 states and 22849 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) [2022-12-13 18:19:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:19:58,685 INFO L93 Difference]: Finished difference Result 17279 states and 24833 transitions. [2022-12-13 18:19:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 18:19:58,685 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 [2022-12-13 18:19:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:19:58,712 INFO L225 Difference]: With dead ends: 17279 [2022-12-13 18:19:58,713 INFO L226 Difference]: Without dead ends: 14341 [2022-12-13 18:19:58,721 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:19:58,721 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 420 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:19:58,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 863 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:19:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14341 states. [2022-12-13 18:19:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14341 to 14226. [2022-12-13 18:19:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14226 states, 12137 states have (on average 1.4381642910109582) internal successors, (17455), 12305 states have internal predecessors, (17455), 1244 states have call successors, (1244), 715 states have call predecessors, (1244), 843 states have return successors, (2241), 1238 states have call predecessors, (2241), 1240 states have call successors, (2241) [2022-12-13 18:19:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14226 states to 14226 states and 20940 transitions. [2022-12-13 18:19:59,861 INFO L78 Accepts]: Start accepts. Automaton has 14226 states and 20940 transitions. Word has length 91 [2022-12-13 18:19:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:19:59,861 INFO L495 AbstractCegarLoop]: Abstraction has 14226 states and 20940 transitions. [2022-12-13 18:19:59,861 INFO L496 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) [2022-12-13 18:19:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 14226 states and 20940 transitions. [2022-12-13 18:19:59,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-13 18:19:59,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:19:59,866 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:19:59,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 18:19:59,866 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:19:59,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:19:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash 119295803, now seen corresponding path program 1 times [2022-12-13 18:19:59,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:19:59,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780869938] [2022-12-13 18:19:59,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:19:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:19:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:59,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:19:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:59,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:19:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:59,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:19:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:59,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:19:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:59,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 18:19:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:59,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 18:19:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:59,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 18:19:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 18:19:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:19:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 18:19:59,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:19:59,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780869938] [2022-12-13 18:19:59,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780869938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:19:59,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:19:59,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 18:19:59,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306591870] [2022-12-13 18:19:59,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:19:59,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:19:59,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:19:59,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:19:59,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:19:59,953 INFO L87 Difference]: Start difference. First operand 14226 states and 20940 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) [2022-12-13 18:20:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:02,184 INFO L93 Difference]: Finished difference Result 16644 states and 24023 transitions. [2022-12-13 18:20:02,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 18:20:02,185 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 [2022-12-13 18:20:02,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:02,211 INFO L225 Difference]: With dead ends: 16644 [2022-12-13 18:20:02,211 INFO L226 Difference]: Without dead ends: 15024 [2022-12-13 18:20:02,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-12-13 18:20:02,218 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 1638 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:02,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1672 Valid, 1107 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 18:20:02,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15024 states. [2022-12-13 18:20:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15024 to 14847. [2022-12-13 18:20:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14847 states, 12604 states have (on average 1.4278800380831482) internal successors, (17997), 12780 states have internal predecessors, (17997), 1321 states have call successors, (1321), 763 states have call predecessors, (1321), 920 states have return successors, (2372), 1336 states have call predecessors, (2372), 1317 states have call successors, (2372) [2022-12-13 18:20:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14847 states to 14847 states and 21690 transitions. [2022-12-13 18:20:03,455 INFO L78 Accepts]: Start accepts. Automaton has 14847 states and 21690 transitions. Word has length 92 [2022-12-13 18:20:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:03,455 INFO L495 AbstractCegarLoop]: Abstraction has 14847 states and 21690 transitions. [2022-12-13 18:20:03,455 INFO L496 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) [2022-12-13 18:20:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 14847 states and 21690 transitions. [2022-12-13 18:20:03,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-13 18:20:03,467 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:03,467 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 18:20:03,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 18:20:03,467 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:20:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1316817982, now seen corresponding path program 1 times [2022-12-13 18:20:03,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:03,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427088696] [2022-12-13 18:20:03,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:03,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:03,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:20:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:03,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:20:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:20:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:03,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:20:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:03,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:20:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:20:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:03,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:20:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:03,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 18:20:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 18:20:03,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:03,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427088696] [2022-12-13 18:20:03,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427088696] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:20:03,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002681854] [2022-12-13 18:20:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:03,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:20:03,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:20:03,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:20:03,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 18:20:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:03,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:20:03,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:20:03,728 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 18:20:03,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:20:03,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002681854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:03,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:20:03,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 18:20:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210795153] [2022-12-13 18:20:03,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:03,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:20:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:20:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:20:03,730 INFO L87 Difference]: Start difference. First operand 14847 states and 21690 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) [2022-12-13 18:20:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:05,820 INFO L93 Difference]: Finished difference Result 39792 states and 59630 transitions. [2022-12-13 18:20:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:05,821 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 [2022-12-13 18:20:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:05,879 INFO L225 Difference]: With dead ends: 39792 [2022-12-13 18:20:05,880 INFO L226 Difference]: Without dead ends: 27057 [2022-12-13 18:20:05,904 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:20:05,904 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 327 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:05,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 598 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:05,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27057 states. [2022-12-13 18:20:08,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27057 to 26853. [2022-12-13 18:20:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26853 states, 22956 states have (on average 1.4404512981355637) internal successors, (33067), 23279 states have internal predecessors, (33067), 2287 states have call successors, (2287), 1355 states have call predecessors, (2287), 1608 states have return successors, (4207), 2251 states have call predecessors, (4207), 2283 states have call successors, (4207) [2022-12-13 18:20:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26853 states to 26853 states and 39561 transitions. [2022-12-13 18:20:08,152 INFO L78 Accepts]: Start accepts. Automaton has 26853 states and 39561 transitions. Word has length 129 [2022-12-13 18:20:08,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:08,152 INFO L495 AbstractCegarLoop]: Abstraction has 26853 states and 39561 transitions. [2022-12-13 18:20:08,152 INFO L496 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) [2022-12-13 18:20:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 26853 states and 39561 transitions. [2022-12-13 18:20:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-12-13 18:20:08,174 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:08,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 18:20:08,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 18:20:08,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 18:20:08,376 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:20:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash 42487134, now seen corresponding path program 1 times [2022-12-13 18:20:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:08,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595389149] [2022-12-13 18:20:08,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:08,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:08,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:20:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:08,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:20:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:08,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:20:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:08,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:20:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:08,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:20:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:20:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:20:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:08,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 18:20:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 18:20:08,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:08,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595389149] [2022-12-13 18:20:08,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595389149] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:20:08,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124207583] [2022-12-13 18:20:08,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:08,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:20:08,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:20:08,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:20:08,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 18:20:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:08,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:20:08,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:20:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 18:20:08,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:20:08,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124207583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:08,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:20:08,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:20:08,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392218548] [2022-12-13 18:20:08,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:08,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:20:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:08,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:20:08,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:20:08,620 INFO L87 Difference]: Start difference. First operand 26853 states and 39561 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) [2022-12-13 18:20:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:12,930 INFO L93 Difference]: Finished difference Result 75152 states and 112168 transitions. [2022-12-13 18:20:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:12,931 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 [2022-12-13 18:20:12,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:12,995 INFO L225 Difference]: With dead ends: 75152 [2022-12-13 18:20:12,995 INFO L226 Difference]: Without dead ends: 31112 [2022-12-13 18:20:13,050 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:20:13,050 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 192 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:13,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 950 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31112 states. [2022-12-13 18:20:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31112 to 31112. [2022-12-13 18:20:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31112 states, 26636 states have (on average 1.4399684637332932) internal successors, (38355), 26991 states have internal predecessors, (38355), 2630 states have call successors, (2630), 1559 states have call predecessors, (2630), 1844 states have return successors, (4853), 2594 states have call predecessors, (4853), 2626 states have call successors, (4853) [2022-12-13 18:20:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31112 states to 31112 states and 45838 transitions. [2022-12-13 18:20:15,915 INFO L78 Accepts]: Start accepts. Automaton has 31112 states and 45838 transitions. Word has length 129 [2022-12-13 18:20:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:15,916 INFO L495 AbstractCegarLoop]: Abstraction has 31112 states and 45838 transitions. [2022-12-13 18:20:15,916 INFO L496 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) [2022-12-13 18:20:15,916 INFO L276 IsEmpty]: Start isEmpty. Operand 31112 states and 45838 transitions. [2022-12-13 18:20:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 18:20:15,943 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:15,943 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:20:15,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 18:20:16,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 18:20:16,144 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:20:16,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:16,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2097013156, now seen corresponding path program 1 times [2022-12-13 18:20:16,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:16,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388036506] [2022-12-13 18:20:16,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:16,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:20:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:20:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:20:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:20:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 18:20:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 18:20:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 18:20:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 18:20:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 18:20:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 18:20:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:20:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:20:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:20:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 18:20:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 18:20:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 18:20:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 18:20:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 18:20:16,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:16,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388036506] [2022-12-13 18:20:16,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388036506] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:20:16,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823211860] [2022-12-13 18:20:16,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:16,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:20:16,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:20:16,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:20:16,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 18:20:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:16,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:20:16,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:20:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 18:20:16,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:20:16,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823211860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:16,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:20:16,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 18:20:16,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749499720] [2022-12-13 18:20:16,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:16,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:20:16,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:16,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:20:16,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:20:16,463 INFO L87 Difference]: Start difference. First operand 31112 states and 45838 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) [2022-12-13 18:20:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:19,303 INFO L93 Difference]: Finished difference Result 35038 states and 50667 transitions. [2022-12-13 18:20:19,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:19,304 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 [2022-12-13 18:20:19,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:19,366 INFO L225 Difference]: With dead ends: 35038 [2022-12-13 18:20:19,366 INFO L226 Difference]: Without dead ends: 33024 [2022-12-13 18:20:19,377 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:20:19,377 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 61 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 751 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 [2022-12-13 18:20:19,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 751 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33024 states. [2022-12-13 18:20:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33024 to 32982. [2022-12-13 18:20:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32982 states, 28093 states have (on average 1.4277222083793115) internal successors, (40109), 28471 states have internal predecessors, (40109), 2837 states have call successors, (2837), 1720 states have call predecessors, (2837), 2050 states have return successors, (5121), 2823 states have call predecessors, (5121), 2833 states have call successors, (5121) [2022-12-13 18:20:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32982 states to 32982 states and 48067 transitions. [2022-12-13 18:20:22,226 INFO L78 Accepts]: Start accepts. Automaton has 32982 states and 48067 transitions. Word has length 163 [2022-12-13 18:20:22,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:22,226 INFO L495 AbstractCegarLoop]: Abstraction has 32982 states and 48067 transitions. [2022-12-13 18:20:22,226 INFO L496 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) [2022-12-13 18:20:22,226 INFO L276 IsEmpty]: Start isEmpty. Operand 32982 states and 48067 transitions. [2022-12-13 18:20:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-13 18:20:22,277 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:22,277 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 18:20:22,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 18:20:22,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 18:20:22,478 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:20:22,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:22,480 INFO L85 PathProgramCache]: Analyzing trace with hash 394719976, now seen corresponding path program 1 times [2022-12-13 18:20:22,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:22,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481530562] [2022-12-13 18:20:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:22,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:22,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:20:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:22,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:20:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:22,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:20:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:20:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:22,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:20:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:22,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:20:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:22,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:20:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:22,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 18:20:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:22,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:20:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 18:20:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:22,610 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:20:22,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:22,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481530562] [2022-12-13 18:20:22,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481530562] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:20:22,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313500357] [2022-12-13 18:20:22,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:22,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:20:22,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:20:22,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:20:22,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 18:20:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:22,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:20:22,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:20:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 18:20:22,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:20:22,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313500357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:22,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:20:22,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 18:20:22,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378720309] [2022-12-13 18:20:22,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:22,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:20:22,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:22,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:20:22,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:20:22,837 INFO L87 Difference]: Start difference. First operand 32982 states and 48067 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) [2022-12-13 18:20:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:27,850 INFO L93 Difference]: Finished difference Result 90123 states and 134612 transitions. [2022-12-13 18:20:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:27,851 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 [2022-12-13 18:20:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:27,997 INFO L225 Difference]: With dead ends: 90123 [2022-12-13 18:20:27,997 INFO L226 Difference]: Without dead ends: 61123 [2022-12-13 18:20:28,057 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:20:28,058 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 281 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:28,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 597 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61123 states. [2022-12-13 18:20:33,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61123 to 60651. [2022-12-13 18:20:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60651 states, 51897 states have (on average 1.4366148332273543) internal successors, (74556), 52601 states have internal predecessors, (74556), 5090 states have call successors, (5090), 3108 states have call predecessors, (5090), 3662 states have return successors, (9394), 4974 states have call predecessors, (9394), 5086 states have call successors, (9394) [2022-12-13 18:20:33,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60651 states to 60651 states and 89040 transitions. [2022-12-13 18:20:33,305 INFO L78 Accepts]: Start accepts. Automaton has 60651 states and 89040 transitions. Word has length 167 [2022-12-13 18:20:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:33,305 INFO L495 AbstractCegarLoop]: Abstraction has 60651 states and 89040 transitions. [2022-12-13 18:20:33,305 INFO L496 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) [2022-12-13 18:20:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 60651 states and 89040 transitions. [2022-12-13 18:20:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-12-13 18:20:33,371 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:33,371 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 18:20:33,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 18:20:33,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 18:20:33,573 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:20:33,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:33,574 INFO L85 PathProgramCache]: Analyzing trace with hash 364628884, now seen corresponding path program 1 times [2022-12-13 18:20:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:33,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508259378] [2022-12-13 18:20:33,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:33,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:20:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:20:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:20:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:20:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:20:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:20:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:20:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 18:20:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:20:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-12-13 18:20:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,679 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 18:20:33,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:33,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508259378] [2022-12-13 18:20:33,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508259378] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:20:33,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200669495] [2022-12-13 18:20:33,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:33,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:20:33,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:20:33,681 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:20:33,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 18:20:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:33,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:20:33,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:20:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 18:20:33,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:20:33,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200669495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:33,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:20:33,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 18:20:33,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18151792] [2022-12-13 18:20:33,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:33,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:20:33,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:33,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:20:33,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:20:33,843 INFO L87 Difference]: Start difference. First operand 60651 states and 89040 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) [2022-12-13 18:20:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:40,982 INFO L93 Difference]: Finished difference Result 119708 states and 178004 transitions. [2022-12-13 18:20:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:40,983 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 [2022-12-13 18:20:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:41,182 INFO L225 Difference]: With dead ends: 119708 [2022-12-13 18:20:41,183 INFO L226 Difference]: Without dead ends: 85760 [2022-12-13 18:20:41,244 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:20:41,244 INFO L413 NwaCegarLoop]: 393 mSDtfsCounter, 282 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:41,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 602 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85760 states. [2022-12-13 18:20:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85760 to 85084. [2022-12-13 18:20:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85084 states, 73028 states have (on average 1.4420085446677986) internal successors, (105307), 73992 states have internal predecessors, (105307), 7001 states have call successors, (7001), 4307 states have call predecessors, (7001), 5053 states have return successors, (12716), 6817 states have call predecessors, (12716), 6997 states have call successors, (12716) [2022-12-13 18:20:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85084 states to 85084 states and 125024 transitions. [2022-12-13 18:20:48,337 INFO L78 Accepts]: Start accepts. Automaton has 85084 states and 125024 transitions. Word has length 167 [2022-12-13 18:20:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:20:48,338 INFO L495 AbstractCegarLoop]: Abstraction has 85084 states and 125024 transitions. [2022-12-13 18:20:48,338 INFO L496 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) [2022-12-13 18:20:48,338 INFO L276 IsEmpty]: Start isEmpty. Operand 85084 states and 125024 transitions. [2022-12-13 18:20:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 18:20:48,431 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:20:48,431 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:20:48,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 18:20:48,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:20:48,633 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:20:48,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:20:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1534367303, now seen corresponding path program 1 times [2022-12-13 18:20:48,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:20:48,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217440945] [2022-12-13 18:20:48,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:48,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:20:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:20:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:20:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:20:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:20:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:20:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 18:20:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 18:20:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:20:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-12-13 18:20:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:20:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 18:20:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-13 18:20:48,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:20:48,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217440945] [2022-12-13 18:20:48,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217440945] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:20:48,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498695788] [2022-12-13 18:20:48,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:20:48,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:20:48,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:20:48,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:20:48,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 18:20:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:20:48,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:20:48,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:20:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 18:20:48,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:20:48,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498695788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:20:48,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:20:48,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:20:48,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469887964] [2022-12-13 18:20:48,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:20:48,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:20:48,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:20:48,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:20:48,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:20:48,931 INFO L87 Difference]: Start difference. First operand 85084 states and 125024 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) [2022-12-13 18:20:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:20:56,505 INFO L93 Difference]: Finished difference Result 160022 states and 237029 transitions. [2022-12-13 18:20:56,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:20:56,506 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 [2022-12-13 18:20:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:20:56,693 INFO L225 Difference]: With dead ends: 160022 [2022-12-13 18:20:56,693 INFO L226 Difference]: Without dead ends: 78921 [2022-12-13 18:20:56,814 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:20:56,815 INFO L413 NwaCegarLoop]: 375 mSDtfsCounter, 304 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 18:20:56,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 419 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:20:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78921 states. [2022-12-13 18:21:04,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78921 to 78921. [2022-12-13 18:21:04,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78921 states, 68201 states have (on average 1.3923842758903828) internal successors, (94962), 68901 states have internal predecessors, (94962), 5986 states have call successors, (5986), 4114 states have call predecessors, (5986), 4732 states have return successors, (10370), 5938 states have call predecessors, (10370), 5982 states have call successors, (10370) [2022-12-13 18:21:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78921 states to 78921 states and 111318 transitions. [2022-12-13 18:21:04,488 INFO L78 Accepts]: Start accepts. Automaton has 78921 states and 111318 transitions. Word has length 185 [2022-12-13 18:21:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:21:04,557 INFO L495 AbstractCegarLoop]: Abstraction has 78921 states and 111318 transitions. [2022-12-13 18:21:04,557 INFO L496 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) [2022-12-13 18:21:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 78921 states and 111318 transitions. [2022-12-13 18:21:04,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 18:21:04,637 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:21:04,637 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:21:04,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 18:21:04,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 18:21:04,839 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:21:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:21:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash 401388635, now seen corresponding path program 1 times [2022-12-13 18:21:04,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:21:04,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769442170] [2022-12-13 18:21:04,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:21:04,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:21:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:04,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:21:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:21:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:21:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:21:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:04,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:21:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 18:21:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:04,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 18:21:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:04,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:21:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:04,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 18:21:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:04,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:21:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:04,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 18:21:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-13 18:21:04,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:21:04,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769442170] [2022-12-13 18:21:04,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769442170] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:21:04,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520496920] [2022-12-13 18:21:04,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:21:04,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:21:04,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:21:04,974 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:21:04,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 18:21:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:05,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:21:05,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:21:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 18:21:05,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:21:05,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520496920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:21:05,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:21:05,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:21:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085615784] [2022-12-13 18:21:05,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:21:05,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:21:05,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:21:05,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:21:05,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:21:05,108 INFO L87 Difference]: Start difference. First operand 78921 states and 111318 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) [2022-12-13 18:21:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:21:12,192 INFO L93 Difference]: Finished difference Result 131806 states and 188383 transitions. [2022-12-13 18:21:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:21:12,193 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 [2022-12-13 18:21:12,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:21:12,351 INFO L225 Difference]: With dead ends: 131806 [2022-12-13 18:21:12,351 INFO L226 Difference]: Without dead ends: 67760 [2022-12-13 18:21:12,441 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:21:12,441 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:21:12,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 414 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:21:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67760 states. [2022-12-13 18:21:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67760 to 48868. [2022-12-13 18:21:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48868 states, 42179 states have (on average 1.341899997629152) internal successors, (56600), 42563 states have internal predecessors, (56600), 3671 states have call successors, (3671), 2654 states have call predecessors, (3671), 3016 states have return successors, (5501), 3667 states have call predecessors, (5501), 3667 states have call successors, (5501) [2022-12-13 18:21:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48868 states to 48868 states and 65772 transitions. [2022-12-13 18:21:18,328 INFO L78 Accepts]: Start accepts. Automaton has 48868 states and 65772 transitions. Word has length 185 [2022-12-13 18:21:18,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:21:18,328 INFO L495 AbstractCegarLoop]: Abstraction has 48868 states and 65772 transitions. [2022-12-13 18:21:18,328 INFO L496 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) [2022-12-13 18:21:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 48868 states and 65772 transitions. [2022-12-13 18:21:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 18:21:18,370 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:21:18,371 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:21:18,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 18:21:18,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 18:21:18,572 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:21:18,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:21:18,573 INFO L85 PathProgramCache]: Analyzing trace with hash 837868665, now seen corresponding path program 1 times [2022-12-13 18:21:18,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:21:18,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949713956] [2022-12-13 18:21:18,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:21:18,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:21:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:21:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:21:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:21:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:21:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:21:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 18:21:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 18:21:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:21:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 18:21:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:21:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 18:21:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-13 18:21:18,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:21:18,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949713956] [2022-12-13 18:21:18,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949713956] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:21:18,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724987202] [2022-12-13 18:21:18,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:21:18,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:21:18,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:21:18,708 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:21:18,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 18:21:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:18,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:21:18,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:21:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-13 18:21:18,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:21:18,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724987202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:21:18,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:21:18,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:21:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231819587] [2022-12-13 18:21:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:21:18,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:21:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:21:18,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:21:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:21:18,804 INFO L87 Difference]: Start difference. First operand 48868 states and 65772 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) [2022-12-13 18:21:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:21:25,204 INFO L93 Difference]: Finished difference Result 97547 states and 131237 transitions. [2022-12-13 18:21:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:21:25,205 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 [2022-12-13 18:21:25,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:21:25,311 INFO L225 Difference]: With dead ends: 97547 [2022-12-13 18:21:25,311 INFO L226 Difference]: Without dead ends: 52662 [2022-12-13 18:21:25,361 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:21:25,362 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:21:25,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 603 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:21:25,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52662 states. [2022-12-13 18:21:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52662 to 51988. [2022-12-13 18:21:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51988 states, 45090 states have (on average 1.3125748502994012) internal successors, (59184), 45455 states have internal predecessors, (59184), 3690 states have call successors, (3690), 2825 states have call predecessors, (3690), 3206 states have return successors, (5482), 3724 states have call predecessors, (5482), 3686 states have call successors, (5482) [2022-12-13 18:21:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51988 states to 51988 states and 68356 transitions. [2022-12-13 18:21:31,762 INFO L78 Accepts]: Start accepts. Automaton has 51988 states and 68356 transitions. Word has length 185 [2022-12-13 18:21:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:21:31,762 INFO L495 AbstractCegarLoop]: Abstraction has 51988 states and 68356 transitions. [2022-12-13 18:21:31,763 INFO L496 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) [2022-12-13 18:21:31,763 INFO L276 IsEmpty]: Start isEmpty. Operand 51988 states and 68356 transitions. [2022-12-13 18:21:31,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-13 18:21:31,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:21:31,807 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:21:31,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 18:21:32,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 18:21:32,009 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:21:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:21:32,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1604039887, now seen corresponding path program 1 times [2022-12-13 18:21:32,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:21:32,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746077767] [2022-12-13 18:21:32,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:21:32,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:21:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:21:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:21:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:21:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:21:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 18:21:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 18:21:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 18:21:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 18:21:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 18:21:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 18:21:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:21:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:21:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:21:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 18:21:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 18:21:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 18:21:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:21:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:21:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-12-13 18:21:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-12-13 18:21:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-12-13 18:21:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:21:32,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746077767] [2022-12-13 18:21:32,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746077767] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:21:32,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673486193] [2022-12-13 18:21:32,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:21:32,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:21:32,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:21:32,133 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:21:32,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 18:21:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:32,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:21:32,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:21:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-12-13 18:21:32,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:21:32,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673486193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:21:32,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:21:32,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 18:21:32,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330489192] [2022-12-13 18:21:32,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:21:32,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:21:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:21:32,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:21:32,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:21:32,319 INFO L87 Difference]: Start difference. First operand 51988 states and 68356 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) [2022-12-13 18:21:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:21:38,709 INFO L93 Difference]: Finished difference Result 59908 states and 77964 transitions. [2022-12-13 18:21:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:21:38,710 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 [2022-12-13 18:21:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:21:38,817 INFO L225 Difference]: With dead ends: 59908 [2022-12-13 18:21:38,817 INFO L226 Difference]: Without dead ends: 55948 [2022-12-13 18:21:38,835 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:21:38,835 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:21:38,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 741 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:21:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55948 states. [2022-12-13 18:21:45,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55948 to 55938. [2022-12-13 18:21:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55938 states, 48168 states have (on average 1.3055347948845706) internal successors, (62885), 48580 states have internal predecessors, (62885), 4132 states have call successors, (4132), 3147 states have call predecessors, (4132), 3636 states have return successors, (6089), 4227 states have call predecessors, (6089), 4128 states have call successors, (6089) [2022-12-13 18:21:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55938 states to 55938 states and 73106 transitions. [2022-12-13 18:21:45,637 INFO L78 Accepts]: Start accepts. Automaton has 55938 states and 73106 transitions. Word has length 195 [2022-12-13 18:21:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:21:45,637 INFO L495 AbstractCegarLoop]: Abstraction has 55938 states and 73106 transitions. [2022-12-13 18:21:45,637 INFO L496 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) [2022-12-13 18:21:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 55938 states and 73106 transitions. [2022-12-13 18:21:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-13 18:21:45,681 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:21:45,681 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:21:45,686 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 18:21:45,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 18:21:45,883 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:21:45,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:21:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1793534131, now seen corresponding path program 1 times [2022-12-13 18:21:45,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:21:45,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909258676] [2022-12-13 18:21:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:21:45,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:21:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:45,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:21:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:21:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 18:21:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:21:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:45,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 18:21:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:45,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 18:21:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:45,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 18:21:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:45,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 18:21:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 18:21:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 18:21:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:21:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:21:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 18:21:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 18:21:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 18:21:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 18:21:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 18:21:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 18:21:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-12-13 18:21:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-12-13 18:21:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,020 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-12-13 18:21:46,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:21:46,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909258676] [2022-12-13 18:21:46,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909258676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:21:46,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488028043] [2022-12-13 18:21:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:21:46,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:21:46,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:21:46,021 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:21:46,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 18:21:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:46,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:21:46,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:21:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-12-13 18:21:46,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:21:46,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488028043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:21:46,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:21:46,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 18:21:46,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563458344] [2022-12-13 18:21:46,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:21:46,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:21:46,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:21:46,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:21:46,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:21:46,251 INFO L87 Difference]: Start difference. First operand 55938 states and 73106 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) [2022-12-13 18:21:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:21:52,787 INFO L93 Difference]: Finished difference Result 62444 states and 81298 transitions. [2022-12-13 18:21:52,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:21:52,788 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 [2022-12-13 18:21:52,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:21:52,870 INFO L225 Difference]: With dead ends: 62444 [2022-12-13 18:21:52,870 INFO L226 Difference]: Without dead ends: 48019 [2022-12-13 18:21:52,893 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:21:52,893 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:21:52,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 359 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:21:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48019 states. [2022-12-13 18:21:58,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48019 to 48019. [2022-12-13 18:21:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48019 states, 42000 states have (on average 1.3196428571428571) internal successors, (55425), 42315 states have internal predecessors, (55425), 3242 states have call successors, (3242), 2502 states have call predecessors, (3242), 2776 states have return successors, (4871), 3217 states have call predecessors, (4871), 3240 states have call successors, (4871) [2022-12-13 18:21:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48019 states to 48019 states and 63538 transitions. [2022-12-13 18:21:58,967 INFO L78 Accepts]: Start accepts. Automaton has 48019 states and 63538 transitions. Word has length 195 [2022-12-13 18:21:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:21:58,967 INFO L495 AbstractCegarLoop]: Abstraction has 48019 states and 63538 transitions. [2022-12-13 18:21:58,967 INFO L496 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) [2022-12-13 18:21:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 48019 states and 63538 transitions. [2022-12-13 18:21:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-13 18:21:59,009 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:21:59,009 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:21:59,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 18:21:59,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:21:59,210 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:21:59,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:21:59,210 INFO L85 PathProgramCache]: Analyzing trace with hash 158369743, now seen corresponding path program 1 times [2022-12-13 18:21:59,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:21:59,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455543682] [2022-12-13 18:21:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:21:59,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:21:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:21:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:21:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:21:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:21:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:21:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:21:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:21:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 18:21:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 18:21:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:21:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-12-13 18:21:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-13 18:21:59,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:21:59,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455543682] [2022-12-13 18:21:59,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455543682] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:21:59,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127208878] [2022-12-13 18:21:59,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:21:59,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:21:59,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:21:59,323 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:21:59,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 18:21:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:59,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:21:59,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:21:59,448 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 18:21:59,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:21:59,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127208878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:21:59,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:21:59,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:21:59,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922274915] [2022-12-13 18:21:59,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:21:59,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:21:59,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:21:59,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:21:59,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:21:59,449 INFO L87 Difference]: Start difference. First operand 48019 states and 63538 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) [2022-12-13 18:22:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:22:10,021 INFO L93 Difference]: Finished difference Result 136068 states and 181991 transitions. [2022-12-13 18:22:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:22:10,022 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 [2022-12-13 18:22:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:22:10,207 INFO L225 Difference]: With dead ends: 136068 [2022-12-13 18:22:10,207 INFO L226 Difference]: Without dead ends: 88063 [2022-12-13 18:22:10,270 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:22:10,270 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:22:10,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 645 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:22:10,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88063 states. [2022-12-13 18:22:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88063 to 88059. [2022-12-13 18:22:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88059 states, 76761 states have (on average 1.318455986764112) internal successors, (101206), 77390 states have internal predecessors, (101206), 6113 states have call successors, (6113), 4635 states have call predecessors, (6113), 5184 states have return successors, (10570), 6065 states have call predecessors, (10570), 6111 states have call successors, (10570) [2022-12-13 18:22:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88059 states to 88059 states and 117889 transitions. [2022-12-13 18:22:21,191 INFO L78 Accepts]: Start accepts. Automaton has 88059 states and 117889 transitions. Word has length 186 [2022-12-13 18:22:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:22:21,192 INFO L495 AbstractCegarLoop]: Abstraction has 88059 states and 117889 transitions. [2022-12-13 18:22:21,192 INFO L496 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) [2022-12-13 18:22:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 88059 states and 117889 transitions. [2022-12-13 18:22:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-13 18:22:21,276 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:22:21,276 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:22:21,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 18:22:21,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 18:22:21,478 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:22:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:22:21,479 INFO L85 PathProgramCache]: Analyzing trace with hash 355981213, now seen corresponding path program 1 times [2022-12-13 18:22:21,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:22:21,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268924820] [2022-12-13 18:22:21,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:22:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:22:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:22:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:22:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:22:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:22:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:22:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 18:22:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 18:22:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:22:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 18:22:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:22:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-12-13 18:22:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-12-13 18:22:21,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:22:21,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268924820] [2022-12-13 18:22:21,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268924820] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:22:21,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221012214] [2022-12-13 18:22:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:22:21,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:22:21,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:22:21,666 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:22:21,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 18:22:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:21,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:22:21,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:22:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-12-13 18:22:21,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:22:21,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221012214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:22:21,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:22:21,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:22:21,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359968559] [2022-12-13 18:22:21,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:22:21,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:22:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:22:21,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:22:21,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:22:21,797 INFO L87 Difference]: Start difference. First operand 88059 states and 117889 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) [2022-12-13 18:22:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:22:42,859 INFO L93 Difference]: Finished difference Result 261231 states and 353898 transitions. [2022-12-13 18:22:42,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:22:42,860 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 [2022-12-13 18:22:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:22:43,288 INFO L225 Difference]: With dead ends: 261231 [2022-12-13 18:22:43,288 INFO L226 Difference]: Without dead ends: 173190 [2022-12-13 18:22:43,417 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:22:43,417 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:22:43,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 497 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:22:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173190 states. [2022-12-13 18:23:05,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173190 to 171840. [2022-12-13 18:23:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171840 states, 150048 states have (on average 1.310427329921092) internal successors, (196627), 151305 states have internal predecessors, (196627), 11715 states have call successors, (11715), 9015 states have call predecessors, (11715), 10076 states have return successors, (24981), 11583 states have call predecessors, (24981), 11713 states have call successors, (24981) [2022-12-13 18:23:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171840 states to 171840 states and 233323 transitions. [2022-12-13 18:23:05,925 INFO L78 Accepts]: Start accepts. Automaton has 171840 states and 233323 transitions. Word has length 186 [2022-12-13 18:23:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:23:05,926 INFO L495 AbstractCegarLoop]: Abstraction has 171840 states and 233323 transitions. [2022-12-13 18:23:05,926 INFO L496 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) [2022-12-13 18:23:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 171840 states and 233323 transitions. [2022-12-13 18:23:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-12-13 18:23:06,117 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:23:06,117 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:23:06,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 18:23:06,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:23:06,319 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:23:06,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:23:06,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1045374053, now seen corresponding path program 1 times [2022-12-13 18:23:06,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:23:06,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727531355] [2022-12-13 18:23:06,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:23:06,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:23:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:23:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:23:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:23:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:23:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:23:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 18:23:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 18:23:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:23:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 18:23:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:23:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-12-13 18:23:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-12-13 18:23:06,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:23:06,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727531355] [2022-12-13 18:23:06,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727531355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:23:06,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:23:06,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:23:06,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504385345] [2022-12-13 18:23:06,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:23:06,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:23:06,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:23:06,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:23:06,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:23:06,409 INFO L87 Difference]: Start difference. First operand 171840 states and 233323 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) [2022-12-13 18:23:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:23:29,569 INFO L93 Difference]: Finished difference Result 336503 states and 454713 transitions. [2022-12-13 18:23:29,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:23:29,570 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 [2022-12-13 18:23:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:23:30,068 INFO L225 Difference]: With dead ends: 336503 [2022-12-13 18:23:30,068 INFO L226 Difference]: Without dead ends: 164679 [2022-12-13 18:23:30,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:23:30,346 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 404 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 18:23:30,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 323 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 18:23:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164679 states. [2022-12-13 18:23:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164679 to 148539. [2022-12-13 18:23:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148539 states, 130029 states have (on average 1.307800567565697) internal successors, (170052), 132193 states have internal predecessors, (170052), 8873 states have call successors, (8873), 6787 states have call predecessors, (8873), 9636 states have return successors, (21132), 9590 states have call predecessors, (21132), 8871 states have call successors, (21132) [2022-12-13 18:23:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148539 states to 148539 states and 200057 transitions. [2022-12-13 18:23:51,672 INFO L78 Accepts]: Start accepts. Automaton has 148539 states and 200057 transitions. Word has length 186 [2022-12-13 18:23:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:23:51,672 INFO L495 AbstractCegarLoop]: Abstraction has 148539 states and 200057 transitions. [2022-12-13 18:23:51,672 INFO L496 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) [2022-12-13 18:23:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 148539 states and 200057 transitions. [2022-12-13 18:23:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-12-13 18:23:51,922 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:23:51,922 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:23:51,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 18:23:51,923 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:23:51,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:23:51,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1213588627, now seen corresponding path program 1 times [2022-12-13 18:23:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:23:51,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816576625] [2022-12-13 18:23:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:23:51,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:23:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:51,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:23:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:51,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:23:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:51,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:23:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:52,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:23:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:52,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:23:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:52,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 18:23:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:52,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 18:23:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:52,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:23:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:52,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-12-13 18:23:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:52,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:23:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:52,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-12-13 18:23:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-12-13 18:23:52,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:23:52,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816576625] [2022-12-13 18:23:52,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816576625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:23:52,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24689031] [2022-12-13 18:23:52,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:23:52,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:23:52,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:23:52,023 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:23:52,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 18:23:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:52,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:23:52,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:23:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-13 18:23:52,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:23:52,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24689031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:23:52,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:23:52,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:23:52,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300733375] [2022-12-13 18:23:52,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:23:52,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:23:52,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:23:52,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:23:52,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:23:52,134 INFO L87 Difference]: Start difference. First operand 148539 states and 200057 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) [2022-12-13 18:24:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:24:22,692 INFO L93 Difference]: Finished difference Result 362491 states and 493221 transitions. [2022-12-13 18:24:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:24:22,693 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 [2022-12-13 18:24:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:24:23,420 INFO L225 Difference]: With dead ends: 362491 [2022-12-13 18:24:23,420 INFO L226 Difference]: Without dead ends: 213970 [2022-12-13 18:24:23,661 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:24:23,661 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:24:23,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 452 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:24:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213970 states. [2022-12-13 18:24:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213970 to 208706. [2022-12-13 18:24:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208706 states, 182396 states have (on average 1.3074190223469813) internal successors, (238468), 185475 states have internal predecessors, (238468), 12717 states have call successors, (12717), 9633 states have call predecessors, (12717), 13592 states have return successors, (33424), 13629 states have call predecessors, (33424), 12715 states have call successors, (33424) [2022-12-13 18:24:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208706 states to 208706 states and 284609 transitions. [2022-12-13 18:24:54,153 INFO L78 Accepts]: Start accepts. Automaton has 208706 states and 284609 transitions. Word has length 188 [2022-12-13 18:24:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:24:54,153 INFO L495 AbstractCegarLoop]: Abstraction has 208706 states and 284609 transitions. [2022-12-13 18:24:54,153 INFO L496 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) [2022-12-13 18:24:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 208706 states and 284609 transitions. [2022-12-13 18:24:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-13 18:24:54,503 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:24:54,503 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:24:54,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 18:24:54,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:24:54,705 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:24:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:24:54,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2071212901, now seen corresponding path program 1 times [2022-12-13 18:24:54,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:24:54,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392906793] [2022-12-13 18:24:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:24:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:24:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:24:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:24:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:24:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:24:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:24:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:24:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:24:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:24:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-12-13 18:24:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:24:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-12-13 18:24:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-13 18:24:54,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:24:54,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392906793] [2022-12-13 18:24:54,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392906793] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:24:54,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645150851] [2022-12-13 18:24:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:24:54,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:24:54,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:24:54,833 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:24:54,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 18:24:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:24:54,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:24:54,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:24:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 18:24:54,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:24:54,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645150851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:24:54,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:24:54,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:24:54,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584205182] [2022-12-13 18:24:54,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:24:54,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:24:54,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:24:54,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:24:54,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:24:54,948 INFO L87 Difference]: Start difference. First operand 208706 states and 284609 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) [2022-12-13 18:25:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:25:25,541 INFO L93 Difference]: Finished difference Result 350548 states and 495267 transitions. [2022-12-13 18:25:25,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:25:25,542 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 [2022-12-13 18:25:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:25:26,228 INFO L225 Difference]: With dead ends: 350548 [2022-12-13 18:25:26,228 INFO L226 Difference]: Without dead ends: 209186 [2022-12-13 18:25:26,496 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:25:26,497 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:25:26,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 574 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:25:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209186 states. [2022-12-13 18:25:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209186 to 208706. [2022-12-13 18:25:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208706 states, 182396 states have (on average 1.2865961972850282) internal successors, (234670), 185475 states have internal predecessors, (234670), 12717 states have call successors, (12717), 9633 states have call predecessors, (12717), 13592 states have return successors, (33424), 13629 states have call predecessors, (33424), 12715 states have call successors, (33424) [2022-12-13 18:25:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208706 states to 208706 states and 280811 transitions. [2022-12-13 18:25:57,249 INFO L78 Accepts]: Start accepts. Automaton has 208706 states and 280811 transitions. Word has length 190 [2022-12-13 18:25:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:25:57,250 INFO L495 AbstractCegarLoop]: Abstraction has 208706 states and 280811 transitions. [2022-12-13 18:25:57,250 INFO L496 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) [2022-12-13 18:25:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 208706 states and 280811 transitions. [2022-12-13 18:25:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:25:57,624 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:25:57,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:25:57,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 18:25:57,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 18:25:57,826 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:25:57,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:25:57,827 INFO L85 PathProgramCache]: Analyzing trace with hash 939803217, now seen corresponding path program 1 times [2022-12-13 18:25:57,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:25:57,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753844293] [2022-12-13 18:25:57,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:25:57,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:25:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:25:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:57,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:25:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:57,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:25:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:57,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:25:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:57,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:25:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:57,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:25:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:57,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:25:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:57,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:25:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:57,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:25:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:57,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:25:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:57,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:25:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 18:25:57,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:25:57,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753844293] [2022-12-13 18:25:57,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753844293] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:25:57,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821653763] [2022-12-13 18:25:57,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:25:57,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:25:57,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:25:57,945 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:25:57,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 18:25:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:25:58,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:25:58,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:25:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 18:25:58,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:25:58,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821653763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:25:58,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:25:58,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 18:25:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643268328] [2022-12-13 18:25:58,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:25:58,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:25:58,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:25:58,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:25:58,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:25:58,129 INFO L87 Difference]: Start difference. First operand 208706 states and 280811 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) [2022-12-13 18:26:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:26:36,585 INFO L93 Difference]: Finished difference Result 445710 states and 615025 transitions. [2022-12-13 18:26:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:26:36,586 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 [2022-12-13 18:26:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:26:37,203 INFO L225 Difference]: With dead ends: 445710 [2022-12-13 18:26:37,203 INFO L226 Difference]: Without dead ends: 237018 [2022-12-13 18:26:37,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 18:26:37,547 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 287 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:26:37,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 391 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:26:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237018 states. [2022-12-13 18:27:11,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237018 to 224222. [2022-12-13 18:27:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224222 states, 197264 states have (on average 1.2480330927082488) internal successors, (246192), 200615 states have internal predecessors, (246192), 12717 states have call successors, (12717), 10009 states have call predecessors, (12717), 14240 states have return successors, (32455), 13629 states have call predecessors, (32455), 12715 states have call successors, (32455) [2022-12-13 18:27:12,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224222 states to 224222 states and 291364 transitions. [2022-12-13 18:27:12,174 INFO L78 Accepts]: Start accepts. Automaton has 224222 states and 291364 transitions. Word has length 192 [2022-12-13 18:27:12,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:27:12,174 INFO L495 AbstractCegarLoop]: Abstraction has 224222 states and 291364 transitions. [2022-12-13 18:27:12,174 INFO L496 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) [2022-12-13 18:27:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 224222 states and 291364 transitions. [2022-12-13 18:27:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:27:12,417 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:27:12,417 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:27:12,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 18:27:12,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 18:27:12,618 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:27:12,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:27:12,619 INFO L85 PathProgramCache]: Analyzing trace with hash -677637233, now seen corresponding path program 1 times [2022-12-13 18:27:12,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:27:12,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759139937] [2022-12-13 18:27:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:27:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:27:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:12,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:27:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:12,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:27:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:12,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:27:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:12,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:27:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:12,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:27:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:12,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:27:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:12,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:27:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:12,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:27:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:27:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:27:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:12,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:27:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 18:27:12,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:27:12,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759139937] [2022-12-13 18:27:12,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759139937] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:27:12,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19209962] [2022-12-13 18:27:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:27:12,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:27:12,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:27:12,957 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:27:12,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 18:27:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:13,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:27:13,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:27:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 18:27:13,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:27:13,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19209962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:27:13,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:27:13,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 18:27:13,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126991062] [2022-12-13 18:27:13,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:27:13,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:27:13,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:27:13,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:27:13,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:27:13,109 INFO L87 Difference]: Start difference. First operand 224222 states and 291364 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) [2022-12-13 18:27:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:27:34,696 INFO L93 Difference]: Finished difference Result 264980 states and 345643 transitions. [2022-12-13 18:27:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:27:34,697 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 [2022-12-13 18:27:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:27:35,020 INFO L225 Difference]: With dead ends: 264980 [2022-12-13 18:27:35,020 INFO L226 Difference]: Without dead ends: 138724 [2022-12-13 18:27:35,166 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:27:35,166 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 238 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:27:35,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 383 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:27:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138724 states. [2022-12-13 18:27:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138724 to 134472. [2022-12-13 18:27:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134472 states, 118368 states have (on average 1.2318954447147878) internal successors, (145817), 120275 states have internal predecessors, (145817), 7649 states have call successors, (7649), 6009 states have call predecessors, (7649), 8454 states have return successors, (18212), 8203 states have call predecessors, (18212), 7647 states have call successors, (18212) [2022-12-13 18:27:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134472 states to 134472 states and 171678 transitions. [2022-12-13 18:27:56,582 INFO L78 Accepts]: Start accepts. Automaton has 134472 states and 171678 transitions. Word has length 192 [2022-12-13 18:27:56,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:27:56,583 INFO L495 AbstractCegarLoop]: Abstraction has 134472 states and 171678 transitions. [2022-12-13 18:27:56,583 INFO L496 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) [2022-12-13 18:27:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 134472 states and 171678 transitions. [2022-12-13 18:27:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:27:56,683 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:27:56,683 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:27:56,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 18:27:56,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 18:27:56,885 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:27:56,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:27:56,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1481446861, now seen corresponding path program 1 times [2022-12-13 18:27:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:27:56,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957296602] [2022-12-13 18:27:56,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:27:56,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:27:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:56,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:27:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:56,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:27:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:56,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:27:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:56,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:27:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:56,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:27:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:56,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:27:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:57,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:27:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:57,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:27:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:57,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:27:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:57,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:27:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:27:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 18:27:57,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:27:57,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957296602] [2022-12-13 18:27:57,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957296602] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:27:57,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287447856] [2022-12-13 18:27:57,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:27:57,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:27:57,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:27:57,011 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:27:57,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 18:27:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:27:57,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:27:57,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:27:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 18:27:57,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:27:57,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287447856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:27:57,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:27:57,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 18:27:57,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367818685] [2022-12-13 18:27:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:27:57,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:27:57,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:27:57,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:27:57,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:27:57,146 INFO L87 Difference]: Start difference. First operand 134472 states and 171678 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) [2022-12-13 18:28:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:19,430 INFO L93 Difference]: Finished difference Result 256686 states and 336224 transitions. [2022-12-13 18:28:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:28:19,431 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 [2022-12-13 18:28:19,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:19,740 INFO L225 Difference]: With dead ends: 256686 [2022-12-13 18:28:19,741 INFO L226 Difference]: Without dead ends: 128352 [2022-12-13 18:28:19,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 18:28:19,927 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 281 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:19,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 377 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 18:28:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128352 states. [2022-12-13 18:28:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128352 to 114616. [2022-12-13 18:28:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114616 states, 101024 states have (on average 1.2064558916693062) internal successors, (121881), 102635 states have internal predecessors, (121881), 6425 states have call successors, (6425), 5073 states have call predecessors, (6425), 7166 states have return successors, (14892), 6915 states have call predecessors, (14892), 6423 states have call successors, (14892) [2022-12-13 18:28:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114616 states to 114616 states and 143198 transitions. [2022-12-13 18:28:39,518 INFO L78 Accepts]: Start accepts. Automaton has 114616 states and 143198 transitions. Word has length 192 [2022-12-13 18:28:39,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:28:39,518 INFO L495 AbstractCegarLoop]: Abstraction has 114616 states and 143198 transitions. [2022-12-13 18:28:39,518 INFO L496 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) [2022-12-13 18:28:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 114616 states and 143198 transitions. [2022-12-13 18:28:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:28:39,586 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:28:39,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:28:39,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 18:28:39,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:28:39,788 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:28:39,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:28:39,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1414566833, now seen corresponding path program 1 times [2022-12-13 18:28:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:28:39,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375747462] [2022-12-13 18:28:39,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:39,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:28:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:39,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:28:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:39,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:28:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:39,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:28:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:39,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:28:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:39,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:28:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:39,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:28:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:39,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:28:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:39,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:28:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:39,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:28:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:39,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:28:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:39,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:28:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 18:28:39,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:28:39,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375747462] [2022-12-13 18:28:39,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375747462] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:28:39,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66150284] [2022-12-13 18:28:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:28:39,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:28:39,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:28:39,916 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:28:39,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 18:28:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:28:40,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:28:40,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:28:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 18:28:40,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:28:40,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66150284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:28:40,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:28:40,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 18:28:40,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128902211] [2022-12-13 18:28:40,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:28:40,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:28:40,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:28:40,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:28:40,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:28:40,072 INFO L87 Difference]: Start difference. First operand 114616 states and 143198 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) [2022-12-13 18:28:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:28:53,702 INFO L93 Difference]: Finished difference Result 151230 states and 189922 transitions. [2022-12-13 18:28:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:28:53,702 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 [2022-12-13 18:28:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:28:53,850 INFO L225 Difference]: With dead ends: 151230 [2022-12-13 18:28:53,851 INFO L226 Difference]: Without dead ends: 74976 [2022-12-13 18:28:53,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:28:53,928 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 229 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 18:28:53,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 369 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 18:28:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74976 states. [2022-12-13 18:29:06,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74976 to 74976. [2022-12-13 18:29:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74976 states, 66112 states have (on average 1.1939284849951597) internal successors, (78933), 67099 states have internal predecessors, (78933), 4241 states have call successors, (4241), 3321 states have call predecessors, (4241), 4622 states have return successors, (9592), 4559 states have call predecessors, (9592), 4239 states have call successors, (9592) [2022-12-13 18:29:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74976 states to 74976 states and 92766 transitions. [2022-12-13 18:29:07,073 INFO L78 Accepts]: Start accepts. Automaton has 74976 states and 92766 transitions. Word has length 192 [2022-12-13 18:29:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:29:07,073 INFO L495 AbstractCegarLoop]: Abstraction has 74976 states and 92766 transitions. [2022-12-13 18:29:07,073 INFO L496 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) [2022-12-13 18:29:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 74976 states and 92766 transitions. [2022-12-13 18:29:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:29:07,106 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:29:07,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:29:07,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 18:29:07,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:29:07,308 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:29:07,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:29:07,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1092530641, now seen corresponding path program 1 times [2022-12-13 18:29:07,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:29:07,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847143477] [2022-12-13 18:29:07,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:29:07,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:29:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:29:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:29:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:29:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:29:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:29:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:29:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:29:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:29:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:29:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:29:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:29:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 18:29:07,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:29:07,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847143477] [2022-12-13 18:29:07,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847143477] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:29:07,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318353020] [2022-12-13 18:29:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:29:07,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:29:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:29:07,439 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:29:07,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 18:29:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:07,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 18:29:07,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:29:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-12-13 18:29:07,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:29:07,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318353020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:29:07,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:29:07,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 18:29:07,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464073821] [2022-12-13 18:29:07,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:29:07,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:29:07,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:29:07,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:29:07,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:29:07,556 INFO L87 Difference]: Start difference. First operand 74976 states and 92766 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) [2022-12-13 18:29:20,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:29:20,413 INFO L93 Difference]: Finished difference Result 149964 states and 189121 transitions. [2022-12-13 18:29:20,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:29:20,414 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 [2022-12-13 18:29:20,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:29:20,571 INFO L225 Difference]: With dead ends: 149964 [2022-12-13 18:29:20,571 INFO L226 Difference]: Without dead ends: 75004 [2022-12-13 18:29:20,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:29:20,668 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:29:20,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 889 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:29:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75004 states. [2022-12-13 18:29:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75004 to 71550. [2022-12-13 18:29:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71550 states, 62754 states have (on average 1.1741562290849985) internal successors, (73683), 63715 states have internal predecessors, (73683), 4241 states have call successors, (4241), 3321 states have call predecessors, (4241), 4554 states have return successors, (8880), 4517 states have call predecessors, (8880), 4239 states have call successors, (8880) [2022-12-13 18:29:33,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71550 states to 71550 states and 86804 transitions. [2022-12-13 18:29:33,196 INFO L78 Accepts]: Start accepts. Automaton has 71550 states and 86804 transitions. Word has length 192 [2022-12-13 18:29:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:29:33,196 INFO L495 AbstractCegarLoop]: Abstraction has 71550 states and 86804 transitions. [2022-12-13 18:29:33,196 INFO L496 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) [2022-12-13 18:29:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 71550 states and 86804 transitions. [2022-12-13 18:29:33,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:29:33,225 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:29:33,225 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:29:33,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 18:29:33,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 18:29:33,427 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:29:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:29:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash -98376309, now seen corresponding path program 1 times [2022-12-13 18:29:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:29:33,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160844169] [2022-12-13 18:29:33,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:29:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:29:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:29:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:29:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:29:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:29:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:29:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:29:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:29:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:29:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:29:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:29:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:29:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-12-13 18:29:33,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:29:33,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160844169] [2022-12-13 18:29:33,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160844169] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:29:33,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630057111] [2022-12-13 18:29:33,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:29:33,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:29:33,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:29:33,545 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:29:33,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 18:29:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:33,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 18:29:33,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:29:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-13 18:29:33,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:29:33,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630057111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:29:33,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:29:33,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 18:29:33,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262452070] [2022-12-13 18:29:33,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:29:33,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:29:33,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:29:33,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:29:33,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:29:33,647 INFO L87 Difference]: Start difference. First operand 71550 states and 86804 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) [2022-12-13 18:29:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:29:45,572 INFO L93 Difference]: Finished difference Result 142148 states and 175377 transitions. [2022-12-13 18:29:45,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:29:45,572 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 [2022-12-13 18:29:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:29:45,716 INFO L225 Difference]: With dead ends: 142148 [2022-12-13 18:29:45,716 INFO L226 Difference]: Without dead ends: 70614 [2022-12-13 18:29:45,796 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:29:45,796 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:29:45,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 874 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:29:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70614 states. [2022-12-13 18:29:57,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70614 to 69566. [2022-12-13 18:29:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69566 states, 60784 states have (on average 1.1557811266122664) internal successors, (70253), 61741 states have internal predecessors, (70253), 4241 states have call successors, (4241), 3321 states have call predecessors, (4241), 4540 states have return successors, (7989), 4507 states have call predecessors, (7989), 4239 states have call successors, (7989) [2022-12-13 18:29:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69566 states to 69566 states and 82483 transitions. [2022-12-13 18:29:57,424 INFO L78 Accepts]: Start accepts. Automaton has 69566 states and 82483 transitions. Word has length 192 [2022-12-13 18:29:57,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:29:57,424 INFO L495 AbstractCegarLoop]: Abstraction has 69566 states and 82483 transitions. [2022-12-13 18:29:57,424 INFO L496 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) [2022-12-13 18:29:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 69566 states and 82483 transitions. [2022-12-13 18:29:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-13 18:29:57,451 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:29:57,451 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 18:29:57,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 18:29:57,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:29:57,653 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:29:57,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:29:57,654 INFO L85 PathProgramCache]: Analyzing trace with hash 140438725, now seen corresponding path program 1 times [2022-12-13 18:29:57,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:29:57,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149572588] [2022-12-13 18:29:57,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:29:57,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:29:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:29:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:29:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:29:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:29:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:29:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 18:29:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 18:29:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:29:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-12-13 18:29:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:29:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 18:29:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-12-13 18:29:57,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:29:57,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149572588] [2022-12-13 18:29:57,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149572588] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:29:57,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623933100] [2022-12-13 18:29:57,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:29:57,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:29:57,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:29:57,739 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:29:57,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 18:29:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:29:57,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 18:29:57,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:29:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-13 18:29:57,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:29:57,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623933100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:29:57,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:29:57,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 18:29:57,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479044503] [2022-12-13 18:29:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:29:57,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:29:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:29:57,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:29:57,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:29:57,835 INFO L87 Difference]: Start difference. First operand 69566 states and 82483 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) [2022-12-13 18:30:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:30:08,294 INFO L93 Difference]: Finished difference Result 116899 states and 140093 transitions. [2022-12-13 18:30:08,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:30:08,294 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 [2022-12-13 18:30:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:30:08,389 INFO L225 Difference]: With dead ends: 116899 [2022-12-13 18:30:08,389 INFO L226 Difference]: Without dead ends: 47346 [2022-12-13 18:30:08,451 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:30:08,451 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:30:08,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 859 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:30:08,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47346 states. [2022-12-13 18:30:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47346 to 47170. [2022-12-13 18:30:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47170 states, 41573 states have (on average 1.141919033988406) internal successors, (47473), 41951 states have internal predecessors, (47473), 2870 states have call successors, (2870), 2257 states have call predecessors, (2870), 2726 states have return successors, (4287), 2963 states have call predecessors, (4287), 2868 states have call successors, (4287) [2022-12-13 18:30:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47170 states to 47170 states and 54630 transitions. [2022-12-13 18:30:17,807 INFO L78 Accepts]: Start accepts. Automaton has 47170 states and 54630 transitions. Word has length 192 [2022-12-13 18:30:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:30:17,807 INFO L495 AbstractCegarLoop]: Abstraction has 47170 states and 54630 transitions. [2022-12-13 18:30:17,808 INFO L496 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) [2022-12-13 18:30:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 47170 states and 54630 transitions. [2022-12-13 18:30:17,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-12-13 18:30:17,828 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:30:17,828 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:30:17,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 18:30:18,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:30:18,030 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:30:18,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:30:18,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1222006696, now seen corresponding path program 1 times [2022-12-13 18:30:18,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:30:18,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149902545] [2022-12-13 18:30:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:30:18,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:30:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:30:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:30:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:30:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:30:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:30:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:30:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-12-13 18:30:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-12-13 18:30:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-12-13 18:30:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-12-13 18:30:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-12-13 18:30:18,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:30:18,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149902545] [2022-12-13 18:30:18,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149902545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:30:18,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:30:18,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:30:18,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230043564] [2022-12-13 18:30:18,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:30:18,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:30:18,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:30:18,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:30:18,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:30:18,179 INFO L87 Difference]: Start difference. First operand 47170 states and 54630 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) [2022-12-13 18:30:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:30:25,858 INFO L93 Difference]: Finished difference Result 78474 states and 90958 transitions. [2022-12-13 18:30:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 18:30:25,858 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 [2022-12-13 18:30:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:30:25,930 INFO L225 Difference]: With dead ends: 78474 [2022-12-13 18:30:25,930 INFO L226 Difference]: Without dead ends: 37714 [2022-12-13 18:30:25,968 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:30:25,969 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 1041 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 18:30:25,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 761 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 18:30:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37714 states. [2022-12-13 18:30:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37714 to 36070. [2022-12-13 18:30:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36070 states, 31799 states have (on average 1.1416396742035912) internal successors, (36303), 32089 states have internal predecessors, (36303), 2166 states have call successors, (2166), 1697 states have call predecessors, (2166), 2104 states have return successors, (3325), 2285 states have call predecessors, (3325), 2164 states have call successors, (3325) [2022-12-13 18:30:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36070 states to 36070 states and 41794 transitions. [2022-12-13 18:30:32,552 INFO L78 Accepts]: Start accepts. Automaton has 36070 states and 41794 transitions. Word has length 233 [2022-12-13 18:30:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:30:32,552 INFO L495 AbstractCegarLoop]: Abstraction has 36070 states and 41794 transitions. [2022-12-13 18:30:32,552 INFO L496 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) [2022-12-13 18:30:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 36070 states and 41794 transitions. [2022-12-13 18:30:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2022-12-13 18:30:32,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:30:32,572 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:30:32,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 18:30:32,572 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:30:32,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:30:32,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1539503967, now seen corresponding path program 1 times [2022-12-13 18:30:32,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:30:32,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798473688] [2022-12-13 18:30:32,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:30:32,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:30:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:30:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:30:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:30:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:30:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:30:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 18:30:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-12-13 18:30:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-12-13 18:30:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 18:30:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-12-13 18:30:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-12-13 18:30:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2022-12-13 18:30:32,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:30:32,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798473688] [2022-12-13 18:30:32,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798473688] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:30:32,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294009140] [2022-12-13 18:30:32,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:30:32,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:30:32,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:30:32,679 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:30:32,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 18:30:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:32,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 18:30:32,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:30:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-12-13 18:30:32,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:30:32,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294009140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:30:32,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:30:32,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 18:30:32,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608077436] [2022-12-13 18:30:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:30:32,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:30:32,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:30:32,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:30:32,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:30:32,811 INFO L87 Difference]: Start difference. First operand 36070 states and 41794 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) [2022-12-13 18:30:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:30:34,856 INFO L93 Difference]: Finished difference Result 45166 states and 52224 transitions. [2022-12-13 18:30:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:30:34,857 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 [2022-12-13 18:30:34,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:30:34,871 INFO L225 Difference]: With dead ends: 45166 [2022-12-13 18:30:34,871 INFO L226 Difference]: Without dead ends: 7878 [2022-12-13 18:30:34,907 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:30:34,908 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:30:34,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 507 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:30:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2022-12-13 18:30:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 7878. [2022-12-13 18:30:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7878 states, 6886 states have (on average 1.1166134185303513) internal successors, (7689), 6925 states have internal predecessors, (7689), 556 states have call successors, (556), 403 states have call predecessors, (556), 435 states have return successors, (618), 551 states have call predecessors, (618), 554 states have call successors, (618) [2022-12-13 18:30:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7878 states to 7878 states and 8863 transitions. [2022-12-13 18:30:36,092 INFO L78 Accepts]: Start accepts. Automaton has 7878 states and 8863 transitions. Word has length 276 [2022-12-13 18:30:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:30:36,092 INFO L495 AbstractCegarLoop]: Abstraction has 7878 states and 8863 transitions. [2022-12-13 18:30:36,092 INFO L496 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) [2022-12-13 18:30:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 7878 states and 8863 transitions. [2022-12-13 18:30:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-12-13 18:30:36,099 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:30:36,099 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:30:36,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 18:30:36,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:30:36,300 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:30:36,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:30:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash -231218712, now seen corresponding path program 1 times [2022-12-13 18:30:36,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:30:36,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446924290] [2022-12-13 18:30:36,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:30:36,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:30:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:30:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:30:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:30:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:30:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:30:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 18:30:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 18:30:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 18:30:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-12-13 18:30:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-12-13 18:30:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-12-13 18:30:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 49 proven. 43 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-12-13 18:30:36,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:30:36,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446924290] [2022-12-13 18:30:36,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446924290] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:30:36,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759382652] [2022-12-13 18:30:36,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:30:36,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:30:36,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:30:36,452 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:30:36,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 18:30:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:36,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:30:36,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:30:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-13 18:30:36,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:30:36,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759382652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:30:36,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:30:36,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-13 18:30:36,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998930768] [2022-12-13 18:30:36,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:30:36,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:30:36,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:30:36,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:30:36,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:30:36,604 INFO L87 Difference]: Start difference. First operand 7878 states and 8863 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) [2022-12-13 18:30:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:30:37,850 INFO L93 Difference]: Finished difference Result 13012 states and 14740 transitions. [2022-12-13 18:30:37,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:30:37,851 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 [2022-12-13 18:30:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:30:37,861 INFO L225 Difference]: With dead ends: 13012 [2022-12-13 18:30:37,861 INFO L226 Difference]: Without dead ends: 7878 [2022-12-13 18:30:37,866 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:30:37,867 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:30:37,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 500 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:30:37,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2022-12-13 18:30:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 7878. [2022-12-13 18:30:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7878 states, 6886 states have (on average 1.1076096427534128) internal successors, (7627), 6925 states have internal predecessors, (7627), 556 states have call successors, (556), 403 states have call predecessors, (556), 435 states have return successors, (618), 551 states have call predecessors, (618), 554 states have call successors, (618) [2022-12-13 18:30:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7878 states to 7878 states and 8801 transitions. [2022-12-13 18:30:38,994 INFO L78 Accepts]: Start accepts. Automaton has 7878 states and 8801 transitions. Word has length 277 [2022-12-13 18:30:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:30:38,994 INFO L495 AbstractCegarLoop]: Abstraction has 7878 states and 8801 transitions. [2022-12-13 18:30:38,994 INFO L496 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) [2022-12-13 18:30:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 7878 states and 8801 transitions. [2022-12-13 18:30:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-12-13 18:30:39,000 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:30:39,000 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:30:39,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 18:30:39,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-13 18:30:39,202 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:30:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:30:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1157140729, now seen corresponding path program 1 times [2022-12-13 18:30:39,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:30:39,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682297371] [2022-12-13 18:30:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:30:39,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:30:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:30:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:30:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:30:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:30:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:30:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 18:30:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 18:30:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 18:30:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-12-13 18:30:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-12-13 18:30:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-12-13 18:30:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,319 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 71 proven. 102 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2022-12-13 18:30:39,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:30:39,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682297371] [2022-12-13 18:30:39,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682297371] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 18:30:39,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108174743] [2022-12-13 18:30:39,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:30:39,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 18:30:39,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:30:39,321 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 18:30:39,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 18:30:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:39,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:30:39,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:30:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-12-13 18:30:39,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:30:39,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108174743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:30:39,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 18:30:39,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-13 18:30:39,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169731281] [2022-12-13 18:30:39,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:30:39,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:30:39,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:30:39,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:30:39,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:30:39,465 INFO L87 Difference]: Start difference. First operand 7878 states and 8801 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) [2022-12-13 18:30:40,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:30:40,659 INFO L93 Difference]: Finished difference Result 14114 states and 15842 transitions. [2022-12-13 18:30:40,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:30:40,660 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 [2022-12-13 18:30:40,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:30:40,671 INFO L225 Difference]: With dead ends: 14114 [2022-12-13 18:30:40,671 INFO L226 Difference]: Without dead ends: 7878 [2022-12-13 18:30:40,678 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:30:40,678 INFO L413 NwaCegarLoop]: 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 [2022-12-13 18:30:40,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 458 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 18:30:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7878 states. [2022-12-13 18:30:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7878 to 7878. [2022-12-13 18:30:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7878 states, 6886 states have (on average 1.0980249782166716) internal successors, (7561), 6925 states have internal predecessors, (7561), 556 states have call successors, (556), 403 states have call predecessors, (556), 435 states have return successors, (618), 551 states have call predecessors, (618), 554 states have call successors, (618) [2022-12-13 18:30:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7878 states to 7878 states and 8735 transitions. [2022-12-13 18:30:41,883 INFO L78 Accepts]: Start accepts. Automaton has 7878 states and 8735 transitions. Word has length 280 [2022-12-13 18:30:41,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:30:41,883 INFO L495 AbstractCegarLoop]: Abstraction has 7878 states and 8735 transitions. [2022-12-13 18:30:41,883 INFO L496 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) [2022-12-13 18:30:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 7878 states and 8735 transitions. [2022-12-13 18:30:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-12-13 18:30:41,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:30:41,889 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:30:41,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 18:30:42,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-13 18:30:42,090 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:30:42,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:30:42,090 INFO L85 PathProgramCache]: Analyzing trace with hash -82938401, now seen corresponding path program 1 times [2022-12-13 18:30:42,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:30:42,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332242415] [2022-12-13 18:30:42,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:30:42,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:30:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:30:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:30:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:30:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:30:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:30:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 18:30:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 18:30:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 18:30:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 18:30:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-12-13 18:30:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-12-13 18:30:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2022-12-13 18:30:42,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:30:42,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332242415] [2022-12-13 18:30:42,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332242415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:30:42,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:30:42,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:30:42,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750775777] [2022-12-13 18:30:42,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:30:42,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:30:42,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:30:42,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:30:42,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:30:42,293 INFO L87 Difference]: Start difference. First operand 7878 states and 8735 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) [2022-12-13 18:30:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:30:44,692 INFO L93 Difference]: Finished difference Result 8652 states and 9552 transitions. [2022-12-13 18:30:44,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 18:30:44,692 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 [2022-12-13 18:30:44,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:30:44,706 INFO L225 Difference]: With dead ends: 8652 [2022-12-13 18:30:44,706 INFO L226 Difference]: Without dead ends: 8649 [2022-12-13 18:30:44,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-12-13 18:30:44,709 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 1141 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 18:30:44,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 1395 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 18:30:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8649 states. [2022-12-13 18:30:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8649 to 8072. [2022-12-13 18:30:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8072 states, 7055 states have (on average 1.097661233167966) internal successors, (7744), 7094 states have internal predecessors, (7744), 570 states have call successors, (570), 413 states have call predecessors, (570), 446 states have return successors, (634), 566 states have call predecessors, (634), 569 states have call successors, (634) [2022-12-13 18:30:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 8948 transitions. [2022-12-13 18:30:45,953 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 8948 transitions. Word has length 283 [2022-12-13 18:30:45,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:30:45,954 INFO L495 AbstractCegarLoop]: Abstraction has 8072 states and 8948 transitions. [2022-12-13 18:30:45,954 INFO L496 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) [2022-12-13 18:30:45,954 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 8948 transitions. [2022-12-13 18:30:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-12-13 18:30:45,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:30:45,960 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:30:45,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 18:30:45,960 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:30:45,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:30:45,960 INFO L85 PathProgramCache]: Analyzing trace with hash -474097593, now seen corresponding path program 1 times [2022-12-13 18:30:45,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:30:45,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691906397] [2022-12-13 18:30:45,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:30:45,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:30:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:45,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 18:30:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 18:30:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 18:30:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 18:30:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 18:30:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-12-13 18:30:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-12-13 18:30:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 18:30:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 18:30:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-12-13 18:30:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 18:30:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-12-13 18:30:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:30:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2022-12-13 18:30:46,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:30:46,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691906397] [2022-12-13 18:30:46,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691906397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:30:46,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:30:46,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:30:46,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078006509] [2022-12-13 18:30:46,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:30:46,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:30:46,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:30:46,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:30:46,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:30:46,035 INFO L87 Difference]: Start difference. First operand 8072 states and 8948 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) [2022-12-13 18:30:47,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 18:30:47,672 INFO L93 Difference]: Finished difference Result 12075 states and 13536 transitions. [2022-12-13 18:30:47,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:30:47,672 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 [2022-12-13 18:30:47,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 18:30:47,685 INFO L225 Difference]: With dead ends: 12075 [2022-12-13 18:30:47,685 INFO L226 Difference]: Without dead ends: 9393 [2022-12-13 18:30:47,689 INFO L412 NwaCegarLoop]: 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 [2022-12-13 18:30:47,690 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 255 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 18:30:47,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 625 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 18:30:47,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9393 states. [2022-12-13 18:30:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9393 to 8076. [2022-12-13 18:30:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8076 states, 7059 states have (on average 1.0976058931860038) internal successors, (7748), 7098 states have internal predecessors, (7748), 570 states have call successors, (570), 413 states have call predecessors, (570), 446 states have return successors, (634), 566 states have call predecessors, (634), 569 states have call successors, (634) [2022-12-13 18:30:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8076 states to 8076 states and 8952 transitions. [2022-12-13 18:30:48,960 INFO L78 Accepts]: Start accepts. Automaton has 8076 states and 8952 transitions. Word has length 287 [2022-12-13 18:30:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 18:30:48,961 INFO L495 AbstractCegarLoop]: Abstraction has 8076 states and 8952 transitions. [2022-12-13 18:30:48,961 INFO L496 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) [2022-12-13 18:30:48,961 INFO L276 IsEmpty]: Start isEmpty. Operand 8076 states and 8952 transitions. [2022-12-13 18:30:48,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-12-13 18:30:48,966 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 18:30:48,967 INFO L195 NwaCegarLoop]: 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] [2022-12-13 18:30:48,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 18:30:48,967 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 18:30:48,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:30:48,967 INFO L85 PathProgramCache]: Analyzing trace with hash -583149417, now seen corresponding path program 1 times [2022-12-13 18:30:48,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:30:48,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636806100] [2022-12-13 18:30:48,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:30:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:30:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:30:48,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:30:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:30:49,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:30:49,093 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 18:30:49,094 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 18:30:49,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 18:30:49,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 18:30:49,097 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:30:49,101 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:30:49,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:30:49 BoogieIcfgContainer [2022-12-13 18:30:49,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:30:49,217 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:30:49,217 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:30:49,218 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:30:49,218 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:19:22" (3/4) ... [2022-12-13 18:30:49,219 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 18:30:49,339 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 18:30:49,339 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:30:49,340 INFO L158 Benchmark]: Toolchain (without parser) took 687813.18ms. Allocated memory was 132.1MB in the beginning and 7.9GB in the end (delta: 7.8GB). Free memory was 89.4MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 5.3GB. Max. memory is 16.1GB. [2022-12-13 18:30:49,340 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:30:49,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.84ms. Allocated memory is still 132.1MB. Free memory was 89.0MB in the beginning and 69.9MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 18:30:49,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.14ms. Allocated memory was 132.1MB in the beginning and 163.6MB in the end (delta: 31.5MB). Free memory was 69.9MB in the beginning and 133.4MB in the end (delta: -63.5MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-12-13 18:30:49,341 INFO L158 Benchmark]: Boogie Preprocessor took 33.37ms. Allocated memory is still 163.6MB. Free memory was 133.4MB in the beginning and 134.1MB in the end (delta: -711.5kB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-12-13 18:30:49,341 INFO L158 Benchmark]: RCFGBuilder took 590.95ms. Allocated memory is still 163.6MB. Free memory was 134.1MB in the beginning and 99.3MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-12-13 18:30:49,341 INFO L158 Benchmark]: TraceAbstraction took 686729.13ms. Allocated memory was 163.6MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 98.4MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. [2022-12-13 18:30:49,341 INFO L158 Benchmark]: Witness Printer took 122.22ms. Allocated memory is still 7.9GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 38.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-13 18:30:49,342 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.14ms. Allocated memory is still 132.1MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.84ms. Allocated memory is still 132.1MB. Free memory was 89.0MB in the beginning and 69.9MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.14ms. Allocated memory was 132.1MB in the beginning and 163.6MB in the end (delta: 31.5MB). Free memory was 69.9MB in the beginning and 133.4MB in the end (delta: -63.5MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.37ms. Allocated memory is still 163.6MB. Free memory was 133.4MB in the beginning and 134.1MB in the end (delta: -711.5kB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * RCFGBuilder took 590.95ms. Allocated memory is still 163.6MB. Free memory was 134.1MB in the beginning and 99.3MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 686729.13ms. Allocated memory was 163.6MB in the beginning and 7.9GB in the end (delta: 7.7GB). Free memory was 98.4MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 5.2GB. Max. memory is 16.1GB. * Witness Printer took 122.22ms. Allocated memory is still 7.9GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 38.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int t2_pc = 0; [L606] int 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=-2, 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=-2, 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=-2, 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=1, tmp_ndt_2=-3, tmp_ndt_3=4, 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=1, tmp_ndt_2=-3, tmp_ndt_3=4, 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=1, tmp_ndt_2=-3, tmp_ndt_3=4, 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: 686.6s, OverallIterations: 49, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 2.4s, AutomataDifference: 355.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27467 SdHoareTripleChecker+Valid, 16.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26966 mSDsluCounter, 41012 SdHoareTripleChecker+Invalid, 14.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26937 mSDsCounter, 4251 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27272 IncrementalHoareTripleChecker+Invalid, 31523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4251 mSolverCounterUnsat, 14075 mSDtfsCounter, 27272 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6190 GetRequests, 5650 SyntacticMatches, 6 SemanticMatches, 534 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1591 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224222occurred in iteration=36, InterpolantAutomatonStates: 438, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 314.0s AutomataMinimizationTime, 48 MinimizatonAttempts, 93486 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 12114 NumberOfCodeBlocks, 12114 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 11754 ConstructedInterpolants, 0 QuantifiedInterpolants, 20962 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! [2022-12-13 18:30:49,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7978fac7-79b8-4346-9153-3f7faa0b1f29/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE