./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/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_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/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_490a5d20-0b11-4919-93f0-285691654747/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 d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae --- 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 13:37:08,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:37:08,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:37:09,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:37:09,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:37:09,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:37:09,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:37:09,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:37:09,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:37:09,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:37:09,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:37:09,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:37:09,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:37:09,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:37:09,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:37:09,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:37:09,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:37:09,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:37:09,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:37:09,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:37:09,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:37:09,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:37:09,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:37:09,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:37:09,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:37:09,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:37:09,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:37:09,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:37:09,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:37:09,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:37:09,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:37:09,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:37:09,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:37:09,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:37:09,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:37:09,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:37:09,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:37:09,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:37:09,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:37:09,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:37:09,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:37:09,035 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:37:09,055 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:37:09,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:37:09,056 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:37:09,056 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:37:09,056 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:37:09,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:37:09,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:37:09,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:37:09,058 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:37:09,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:37:09,058 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:37:09,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:37:09,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:37:09,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:37:09,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:37:09,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:37:09,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:37:09,059 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:37:09,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:37:09,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:37:09,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:37:09,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:37:09,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:37:09,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:37:09,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:37:09,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:37:09,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:37:09,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:37:09,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:37:09,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:37:09,061 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:37:09,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:37:09,062 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:37:09,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:37:09,062 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:37:09,062 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_490a5d20-0b11-4919-93f0-285691654747/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_490a5d20-0b11-4919-93f0-285691654747/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 -> d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae [2022-12-13 13:37:09,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:37:09,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:37:09,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:37:09,259 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:37:09,259 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:37:09,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-12-13 13:37:11,945 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:37:12,112 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:37:12,112 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-12-13 13:37:12,119 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/data/4dcdc1940/28f0ebba3a3046578941aff7217c3c4c/FLAG7a7abe890 [2022-12-13 13:37:12,132 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/data/4dcdc1940/28f0ebba3a3046578941aff7217c3c4c [2022-12-13 13:37:12,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:37:12,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:37:12,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:37:12,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:37:12,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:37:12,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e883c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12, skipping insertion in model container [2022-12-13 13:37:12,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:37:12,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:37:12,287 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_490a5d20-0b11-4919-93f0-285691654747/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[911,924] [2022-12-13 13:37:12,325 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_490a5d20-0b11-4919-93f0-285691654747/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[8416,8429] [2022-12-13 13:37:12,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:37:12,358 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:37:12,367 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_490a5d20-0b11-4919-93f0-285691654747/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[911,924] [2022-12-13 13:37:12,383 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_490a5d20-0b11-4919-93f0-285691654747/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c[8416,8429] [2022-12-13 13:37:12,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:37:12,423 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:37:12,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12 WrapperNode [2022-12-13 13:37:12,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:37:12,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:37:12,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:37:12,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:37:12,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,473 INFO L138 Inliner]: procedures = 59, calls = 68, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 503 [2022-12-13 13:37:12,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:37:12,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:37:12,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:37:12,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:37:12,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,510 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:37:12,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:37:12,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:37:12,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:37:12,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12" (1/1) ... [2022-12-13 13:37:12,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:37:12,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:12,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:37:12,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:37:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:37:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 13:37:12,576 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 13:37:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-13 13:37:12,576 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-13 13:37:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-13 13:37:12,577 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-13 13:37:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-13 13:37:12,577 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-13 13:37:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-12-13 13:37:12,577 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-12-13 13:37:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-13 13:37:12,577 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-13 13:37:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-13 13:37:12,577 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-13 13:37:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-12-13 13:37:12,578 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-12-13 13:37:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-13 13:37:12,578 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-13 13:37:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-12-13 13:37:12,578 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-12-13 13:37:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-13 13:37:12,578 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-13 13:37:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:37:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-13 13:37:12,579 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-13 13:37:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-12-13 13:37:12,579 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-12-13 13:37:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:37:12,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:37:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-13 13:37:12,579 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-13 13:37:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-12-13 13:37:12,579 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-12-13 13:37:12,662 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:37:12,665 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:37:13,015 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-12-13 13:37:13,015 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 13:37:13,051 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:37:13,058 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:37:13,058 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-13 13:37:13,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:37:13 BoogieIcfgContainer [2022-12-13 13:37:13,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:37:13,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:37:13,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:37:13,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:37:13,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:37:12" (1/3) ... [2022-12-13 13:37:13,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9e5f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:37:13, skipping insertion in model container [2022-12-13 13:37:13,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:37:12" (2/3) ... [2022-12-13 13:37:13,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9e5f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:37:13, skipping insertion in model container [2022-12-13 13:37:13,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:37:13" (3/3) ... [2022-12-13 13:37:13,066 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-12-13 13:37:13,092 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:37:13,092 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 13:37:13,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:37:13,156 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;@38157c1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:37:13,156 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 13:37:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 205 states have (on average 1.5658536585365854) internal successors, (321), 213 states have internal predecessors, (321), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-13 13:37:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 13:37:13,169 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:13,169 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 13:37:13,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:13,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:13,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1020803089, now seen corresponding path program 1 times [2022-12-13 13:37:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:13,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885103792] [2022-12-13 13:37:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:13,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:13,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:13,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:37:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:13,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:37:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:13,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:37:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:13,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 13:37:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:13,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 13:37:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:13,591 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 13:37:13,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:13,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885103792] [2022-12-13 13:37:13,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885103792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:13,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:13,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:37:13,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881376450] [2022-12-13 13:37:13,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:13,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:37:13,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:13,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:37:13,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:13,633 INFO L87 Difference]: Start difference. First operand has 257 states, 205 states have (on average 1.5658536585365854) internal successors, (321), 213 states have internal predecessors, (321), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 13:37:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:14,413 INFO L93 Difference]: Finished difference Result 646 states and 985 transitions. [2022-12-13 13:37:14,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:37:14,416 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 13:37:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:14,428 INFO L225 Difference]: With dead ends: 646 [2022-12-13 13:37:14,428 INFO L226 Difference]: Without dead ends: 397 [2022-12-13 13:37:14,431 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 13:37:14,433 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 691 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:14,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1109 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 13:37:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-12-13 13:37:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 358. [2022-12-13 13:37:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 287 states have (on average 1.456445993031359) internal successors, (418), 294 states have internal predecessors, (418), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-12-13 13:37:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 513 transitions. [2022-12-13 13:37:14,491 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 513 transitions. Word has length 65 [2022-12-13 13:37:14,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:14,491 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 513 transitions. [2022-12-13 13:37:14,492 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 13:37:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 513 transitions. [2022-12-13 13:37:14,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 13:37:14,494 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:14,494 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 13:37:14,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:37:14,495 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:14,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1595275567, now seen corresponding path program 1 times [2022-12-13 13:37:14,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:14,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547249217] [2022-12-13 13:37:14,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:14,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:14,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:14,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:37:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:14,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:37:14,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:14,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:37:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:14,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 13:37:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:14,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 13:37:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:14,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 13:37:14,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:14,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547249217] [2022-12-13 13:37:14,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547249217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:14,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:14,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 13:37:14,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197480531] [2022-12-13 13:37:14,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:14,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:37:14,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:14,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:37:14,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:37:14,635 INFO L87 Difference]: Start difference. First operand 358 states and 513 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 13:37:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:16,133 INFO L93 Difference]: Finished difference Result 1391 states and 1973 transitions. [2022-12-13 13:37:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 13:37:16,134 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 13:37:16,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:16,142 INFO L225 Difference]: With dead ends: 1391 [2022-12-13 13:37:16,142 INFO L226 Difference]: Without dead ends: 1170 [2022-12-13 13:37:16,144 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 13:37:16,145 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 2173 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 1815 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 1815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:16,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 1800 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 1815 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-13 13:37:16,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2022-12-13 13:37:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1031. [2022-12-13 13:37:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 830 states have (on average 1.393975903614458) internal successors, (1157), 845 states have internal predecessors, (1157), 118 states have call successors, (118), 75 states have call predecessors, (118), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2022-12-13 13:37:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1403 transitions. [2022-12-13 13:37:16,213 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1403 transitions. Word has length 65 [2022-12-13 13:37:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:16,213 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1403 transitions. [2022-12-13 13:37:16,213 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 13:37:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1403 transitions. [2022-12-13 13:37:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 13:37:16,214 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:16,215 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 13:37:16,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:37:16,215 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:16,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:16,215 INFO L85 PathProgramCache]: Analyzing trace with hash -306777911, now seen corresponding path program 1 times [2022-12-13 13:37:16,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:16,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114034138] [2022-12-13 13:37:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:16,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:16,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:37:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:16,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:37:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:37:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 13:37:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:16,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 13:37:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:16,374 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 13:37:16,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:16,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114034138] [2022-12-13 13:37:16,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114034138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:16,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:16,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:37:16,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932677981] [2022-12-13 13:37:16,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:16,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:37:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:16,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:37:16,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:37:16,376 INFO L87 Difference]: Start difference. First operand 1031 states and 1403 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 13:37:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:17,022 INFO L93 Difference]: Finished difference Result 2057 states and 2797 transitions. [2022-12-13 13:37:17,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:37:17,023 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 13:37:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:17,029 INFO L225 Difference]: With dead ends: 2057 [2022-12-13 13:37:17,029 INFO L226 Difference]: Without dead ends: 1169 [2022-12-13 13:37:17,031 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 13:37:17,031 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 403 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:17,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1313 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:37:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-12-13 13:37:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1061. [2022-12-13 13:37:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 854 states have (on average 1.379391100702576) internal successors, (1178), 869 states have internal predecessors, (1178), 118 states have call successors, (118), 75 states have call predecessors, (118), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2022-12-13 13:37:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1430 transitions. [2022-12-13 13:37:17,084 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1430 transitions. Word has length 66 [2022-12-13 13:37:17,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:17,084 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1430 transitions. [2022-12-13 13:37:17,084 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 13:37:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1430 transitions. [2022-12-13 13:37:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 13:37:17,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:17,085 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 13:37:17,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:37:17,086 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:17,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:17,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1336137209, now seen corresponding path program 1 times [2022-12-13 13:37:17,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:17,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239359480] [2022-12-13 13:37:17,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:17,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:17,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:17,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:37:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:17,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:37:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:17,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:37:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:17,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 13:37:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:17,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 13:37:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:17,202 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 13:37:17,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:17,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239359480] [2022-12-13 13:37:17,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239359480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:17,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:17,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 13:37:17,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346215769] [2022-12-13 13:37:17,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:17,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:37:17,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:17,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:37:17,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:37:17,205 INFO L87 Difference]: Start difference. First operand 1061 states and 1430 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 13:37:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:18,568 INFO L93 Difference]: Finished difference Result 3399 states and 4617 transitions. [2022-12-13 13:37:18,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 13:37:18,568 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 13:37:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:18,573 INFO L225 Difference]: With dead ends: 3399 [2022-12-13 13:37:18,573 INFO L226 Difference]: Without dead ends: 1304 [2022-12-13 13:37:18,576 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 13:37:18,577 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 2239 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2259 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:18,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2259 Valid, 1829 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 13:37:18,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-12-13 13:37:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1149. [2022-12-13 13:37:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 907 states have (on average 1.3395810363836824) internal successors, (1215), 922 states have internal predecessors, (1215), 138 states have call successors, (138), 89 states have call predecessors, (138), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2022-12-13 13:37:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1508 transitions. [2022-12-13 13:37:18,643 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1508 transitions. Word has length 66 [2022-12-13 13:37:18,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:18,643 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1508 transitions. [2022-12-13 13:37:18,644 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 13:37:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1508 transitions. [2022-12-13 13:37:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:37:18,645 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:18,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] [2022-12-13 13:37:18,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:37:18,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:18,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1682176981, now seen corresponding path program 1 times [2022-12-13 13:37:18,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:18,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793511271] [2022-12-13 13:37:18,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:18,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:18,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:18,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:18,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:18,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:18,725 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 13:37:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:18,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793511271] [2022-12-13 13:37:18,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793511271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:18,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:18,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:37:18,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000376200] [2022-12-13 13:37:18,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:18,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:37:18,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:18,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:37:18,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:37:18,728 INFO L87 Difference]: Start difference. First operand 1149 states and 1508 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:19,367 INFO L93 Difference]: Finished difference Result 1459 states and 1979 transitions. [2022-12-13 13:37:19,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:37:19,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 13:37:19,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:19,373 INFO L225 Difference]: With dead ends: 1459 [2022-12-13 13:37:19,373 INFO L226 Difference]: Without dead ends: 1335 [2022-12-13 13:37:19,374 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 13:37:19,375 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 678 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:19,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 760 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:37:19,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-12-13 13:37:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1270. [2022-12-13 13:37:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1010 states have (on average 1.3574257425742575) internal successors, (1371), 1026 states have internal predecessors, (1371), 149 states have call successors, (149), 95 states have call predecessors, (149), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2022-12-13 13:37:19,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1689 transitions. [2022-12-13 13:37:19,445 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1689 transitions. Word has length 69 [2022-12-13 13:37:19,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:19,446 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1689 transitions. [2022-12-13 13:37:19,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1689 transitions. [2022-12-13 13:37:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:37:19,447 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:19,447 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] [2022-12-13 13:37:19,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:37:19,448 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:19,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1579462617, now seen corresponding path program 1 times [2022-12-13 13:37:19,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:19,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22968615] [2022-12-13 13:37:19,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:19,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:19,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:19,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:19,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:19,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:19,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:19,542 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 13:37:19,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:19,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22968615] [2022-12-13 13:37:19,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22968615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:19,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:19,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:37:19,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792121932] [2022-12-13 13:37:19,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:19,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:37:19,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:19,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:37:19,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:37:19,544 INFO L87 Difference]: Start difference. First operand 1270 states and 1689 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:20,316 INFO L93 Difference]: Finished difference Result 1732 states and 2383 transitions. [2022-12-13 13:37:20,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:37:20,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 13:37:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:20,324 INFO L225 Difference]: With dead ends: 1732 [2022-12-13 13:37:20,324 INFO L226 Difference]: Without dead ends: 1487 [2022-12-13 13:37:20,325 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 13:37:20,325 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 702 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:20,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 961 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 13:37:20,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2022-12-13 13:37:20,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1384. [2022-12-13 13:37:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1106 states have (on average 1.367992766726944) internal successors, (1513), 1123 states have internal predecessors, (1513), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-12-13 13:37:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1855 transitions. [2022-12-13 13:37:20,405 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1855 transitions. Word has length 69 [2022-12-13 13:37:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:20,406 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 1855 transitions. [2022-12-13 13:37:20,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1855 transitions. [2022-12-13 13:37:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:37:20,407 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:20,407 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] [2022-12-13 13:37:20,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:37:20,408 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:20,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:20,408 INFO L85 PathProgramCache]: Analyzing trace with hash -192677207, now seen corresponding path program 1 times [2022-12-13 13:37:20,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:20,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805451751] [2022-12-13 13:37:20,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:20,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:20,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:20,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:20,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:20,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:20,500 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 13:37:20,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:20,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805451751] [2022-12-13 13:37:20,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805451751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:20,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:20,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:37:20,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942866598] [2022-12-13 13:37:20,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:20,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:37:20,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:20,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:37:20,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:37:20,502 INFO L87 Difference]: Start difference. First operand 1384 states and 1855 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:21,037 INFO L93 Difference]: Finished difference Result 1842 states and 2549 transitions. [2022-12-13 13:37:21,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:37:21,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 13:37:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:21,046 INFO L225 Difference]: With dead ends: 1842 [2022-12-13 13:37:21,047 INFO L226 Difference]: Without dead ends: 1483 [2022-12-13 13:37:21,048 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 13:37:21,049 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 684 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:21,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 630 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 13:37:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-12-13 13:37:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1384. [2022-12-13 13:37:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1106 states have (on average 1.3652802893309222) internal successors, (1510), 1123 states have internal predecessors, (1510), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-12-13 13:37:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1852 transitions. [2022-12-13 13:37:21,192 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1852 transitions. Word has length 69 [2022-12-13 13:37:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:21,192 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 1852 transitions. [2022-12-13 13:37:21,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1852 transitions. [2022-12-13 13:37:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:37:21,194 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:21,194 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] [2022-12-13 13:37:21,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:37:21,194 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:21,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:21,195 INFO L85 PathProgramCache]: Analyzing trace with hash 251223467, now seen corresponding path program 1 times [2022-12-13 13:37:21,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:21,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291372235] [2022-12-13 13:37:21,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:21,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:21,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:21,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:21,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:21,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:21,296 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 13:37:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:21,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291372235] [2022-12-13 13:37:21,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291372235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:21,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:21,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:37:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232000771] [2022-12-13 13:37:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:21,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:37:21,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:21,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:37:21,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:37:21,298 INFO L87 Difference]: Start difference. First operand 1384 states and 1852 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:22,095 INFO L93 Difference]: Finished difference Result 2178 states and 3027 transitions. [2022-12-13 13:37:22,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:37:22,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 13:37:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:22,106 INFO L225 Difference]: With dead ends: 2178 [2022-12-13 13:37:22,106 INFO L226 Difference]: Without dead ends: 1819 [2022-12-13 13:37:22,109 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 13:37:22,110 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 733 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:22,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1205 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:37:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2022-12-13 13:37:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1593. [2022-12-13 13:37:22,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1281 states have (on average 1.3762685402029664) internal successors, (1763), 1300 states have internal predecessors, (1763), 180 states have call successors, (180), 113 states have call predecessors, (180), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2022-12-13 13:37:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2153 transitions. [2022-12-13 13:37:22,239 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2153 transitions. Word has length 69 [2022-12-13 13:37:22,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:22,239 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 2153 transitions. [2022-12-13 13:37:22,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2153 transitions. [2022-12-13 13:37:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:37:22,241 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:22,241 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] [2022-12-13 13:37:22,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:37:22,242 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:22,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1789563497, now seen corresponding path program 1 times [2022-12-13 13:37:22,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:22,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017635497] [2022-12-13 13:37:22,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:22,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:22,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:22,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:22,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:22,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:22,321 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 13:37:22,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:22,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017635497] [2022-12-13 13:37:22,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017635497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:22,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:22,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:37:22,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289707251] [2022-12-13 13:37:22,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:22,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:37:22,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:22,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:37:22,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:37:22,323 INFO L87 Difference]: Start difference. First operand 1593 states and 2153 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:23,257 INFO L93 Difference]: Finished difference Result 2881 states and 4034 transitions. [2022-12-13 13:37:23,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:37:23,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 13:37:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:23,270 INFO L225 Difference]: With dead ends: 2881 [2022-12-13 13:37:23,270 INFO L226 Difference]: Without dead ends: 2313 [2022-12-13 13:37:23,272 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 13:37:23,273 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 672 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:23,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1209 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 13:37:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2022-12-13 13:37:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2024. [2022-12-13 13:37:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1646 states have (on average 1.3955042527339003) internal successors, (2297), 1669 states have internal predecessors, (2297), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-12-13 13:37:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2785 transitions. [2022-12-13 13:37:23,463 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2785 transitions. Word has length 69 [2022-12-13 13:37:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:23,463 INFO L495 AbstractCegarLoop]: Abstraction has 2024 states and 2785 transitions. [2022-12-13 13:37:23,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2785 transitions. [2022-12-13 13:37:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:37:23,465 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:23,465 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] [2022-12-13 13:37:23,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:37:23,465 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:23,466 INFO L85 PathProgramCache]: Analyzing trace with hash -239022613, now seen corresponding path program 1 times [2022-12-13 13:37:23,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:23,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035435370] [2022-12-13 13:37:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:23,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:23,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:23,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:23,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:23,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:23,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:23,554 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 13:37:23,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:23,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035435370] [2022-12-13 13:37:23,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035435370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:23,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:23,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:37:23,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248332610] [2022-12-13 13:37:23,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:23,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:37:23,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:23,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:37:23,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:37:23,556 INFO L87 Difference]: Start difference. First operand 2024 states and 2785 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:24,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:24,376 INFO L93 Difference]: Finished difference Result 3560 states and 5064 transitions. [2022-12-13 13:37:24,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:37:24,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 13:37:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:24,383 INFO L225 Difference]: With dead ends: 3560 [2022-12-13 13:37:24,383 INFO L226 Difference]: Without dead ends: 2562 [2022-12-13 13:37:24,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 13:37:24,386 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 382 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:24,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1061 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:37:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2022-12-13 13:37:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2051. [2022-12-13 13:37:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2051 states, 1673 states have (on average 1.389121338912134) internal successors, (2324), 1696 states have internal predecessors, (2324), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-12-13 13:37:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2812 transitions. [2022-12-13 13:37:24,510 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2812 transitions. Word has length 69 [2022-12-13 13:37:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:24,511 INFO L495 AbstractCegarLoop]: Abstraction has 2051 states and 2812 transitions. [2022-12-13 13:37:24,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2812 transitions. [2022-12-13 13:37:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 13:37:24,513 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:24,513 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] [2022-12-13 13:37:24,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:37:24,514 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:24,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:24,514 INFO L85 PathProgramCache]: Analyzing trace with hash 9123881, now seen corresponding path program 1 times [2022-12-13 13:37:24,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:24,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049893955] [2022-12-13 13:37:24,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:24,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:24,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:24,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:24,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:24,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:24,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:24,606 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 13:37:24,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:24,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049893955] [2022-12-13 13:37:24,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049893955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:24,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:24,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:37:24,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849649150] [2022-12-13 13:37:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:24,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:37:24,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:24,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:37:24,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:37:24,608 INFO L87 Difference]: Start difference. First operand 2051 states and 2812 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:26,001 INFO L93 Difference]: Finished difference Result 5545 states and 8068 transitions. [2022-12-13 13:37:26,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:37:26,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 13:37:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:26,013 INFO L225 Difference]: With dead ends: 5545 [2022-12-13 13:37:26,013 INFO L226 Difference]: Without dead ends: 4520 [2022-12-13 13:37:26,016 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 13:37:26,017 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 1479 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:26,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 991 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 13:37:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2022-12-13 13:37:26,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 3969. [2022-12-13 13:37:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3969 states, 3269 states have (on average 1.4028754970939126) internal successors, (4586), 3323 states have internal predecessors, (4586), 410 states have call successors, (410), 251 states have call predecessors, (410), 288 states have return successors, (579), 403 states have call predecessors, (579), 406 states have call successors, (579) [2022-12-13 13:37:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 5575 transitions. [2022-12-13 13:37:26,312 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 5575 transitions. Word has length 69 [2022-12-13 13:37:26,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:26,312 INFO L495 AbstractCegarLoop]: Abstraction has 3969 states and 5575 transitions. [2022-12-13 13:37:26,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 13:37:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 5575 transitions. [2022-12-13 13:37:26,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 13:37:26,315 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:26,315 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 13:37:26,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:37:26,315 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:26,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:26,316 INFO L85 PathProgramCache]: Analyzing trace with hash -411543486, now seen corresponding path program 1 times [2022-12-13 13:37:26,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:26,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279537949] [2022-12-13 13:37:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:26,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:26,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:26,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:37:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:26,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:37:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:37:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 13:37:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:26,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 13:37:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:26,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 13:37:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:26,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 13:37:26,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:26,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279537949] [2022-12-13 13:37:26,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279537949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:26,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:26,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:37:26,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039866623] [2022-12-13 13:37:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:26,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:37:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:26,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:37:26,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:37:26,416 INFO L87 Difference]: Start difference. First operand 3969 states and 5575 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 13:37:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:27,231 INFO L93 Difference]: Finished difference Result 5146 states and 7126 transitions. [2022-12-13 13:37:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:37:27,232 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 13:37:27,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:27,252 INFO L225 Difference]: With dead ends: 5146 [2022-12-13 13:37:27,252 INFO L226 Difference]: Without dead ends: 4140 [2022-12-13 13:37:27,255 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 13:37:27,256 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 266 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:27,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 1421 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 13:37:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2022-12-13 13:37:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4009. [2022-12-13 13:37:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4009 states, 3301 states have (on average 1.3980611935777036) internal successors, (4615), 3355 states have internal predecessors, (4615), 410 states have call successors, (410), 251 states have call predecessors, (410), 296 states have return successors, (587), 411 states have call predecessors, (587), 406 states have call successors, (587) [2022-12-13 13:37:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 5612 transitions. [2022-12-13 13:37:27,509 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 5612 transitions. Word has length 91 [2022-12-13 13:37:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:27,510 INFO L495 AbstractCegarLoop]: Abstraction has 4009 states and 5612 transitions. [2022-12-13 13:37:27,510 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 13:37:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 5612 transitions. [2022-12-13 13:37:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 13:37:27,512 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:27,512 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 13:37:27,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:37:27,512 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:27,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:27,512 INFO L85 PathProgramCache]: Analyzing trace with hash 32357188, now seen corresponding path program 1 times [2022-12-13 13:37:27,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:27,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235699566] [2022-12-13 13:37:27,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:27,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:27,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:27,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:27,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:37:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:37:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:27,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:37:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:27,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 13:37:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:27,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 13:37:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:27,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 13:37:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:27,620 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 13:37:27,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:27,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235699566] [2022-12-13 13:37:27,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235699566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:27,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:27,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:37:27,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706939531] [2022-12-13 13:37:27,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:27,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:37:27,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:27,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:37:27,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:27,622 INFO L87 Difference]: Start difference. First operand 4009 states and 5612 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 13:37:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:28,637 INFO L93 Difference]: Finished difference Result 6047 states and 8217 transitions. [2022-12-13 13:37:28,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:37:28,637 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 13:37:28,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:28,650 INFO L225 Difference]: With dead ends: 6047 [2022-12-13 13:37:28,650 INFO L226 Difference]: Without dead ends: 5002 [2022-12-13 13:37:28,652 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 13:37:28,653 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 694 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:28,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1162 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:37:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2022-12-13 13:37:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4686. [2022-12-13 13:37:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4686 states, 3830 states have (on average 1.3783289817232376) internal successors, (5279), 3897 states have internal predecessors, (5279), 486 states have call successors, (486), 304 states have call predecessors, (486), 368 states have return successors, (700), 494 states have call predecessors, (700), 482 states have call successors, (700) [2022-12-13 13:37:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6465 transitions. [2022-12-13 13:37:28,972 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6465 transitions. Word has length 91 [2022-12-13 13:37:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:28,972 INFO L495 AbstractCegarLoop]: Abstraction has 4686 states and 6465 transitions. [2022-12-13 13:37:28,972 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 13:37:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6465 transitions. [2022-12-13 13:37:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 13:37:28,976 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:28,976 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 13:37:28,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:37:28,976 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:28,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:28,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1971519234, now seen corresponding path program 1 times [2022-12-13 13:37:28,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:28,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225666087] [2022-12-13 13:37:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:28,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:29,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:29,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:37:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:29,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:37:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:29,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:37:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:29,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 13:37:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:29,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 13:37:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 13:37:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:29,063 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 13:37:29,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:29,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225666087] [2022-12-13 13:37:29,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225666087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:29,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:29,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:37:29,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508024066] [2022-12-13 13:37:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:29,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:37:29,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:37:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:37:29,065 INFO L87 Difference]: Start difference. First operand 4686 states and 6465 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 13:37:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:29,952 INFO L93 Difference]: Finished difference Result 8345 states and 11247 transitions. [2022-12-13 13:37:29,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:37:29,953 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 13:37:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:29,967 INFO L225 Difference]: With dead ends: 8345 [2022-12-13 13:37:29,968 INFO L226 Difference]: Without dead ends: 6625 [2022-12-13 13:37:29,971 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 13:37:29,971 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 775 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:29,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 757 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:37:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2022-12-13 13:37:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 6405. [2022-12-13 13:37:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6405 states, 5168 states have (on average 1.3432662538699691) internal successors, (6942), 5271 states have internal predecessors, (6942), 679 states have call successors, (679), 438 states have call predecessors, (679), 556 states have return successors, (1040), 707 states have call predecessors, (1040), 675 states have call successors, (1040) [2022-12-13 13:37:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 8661 transitions. [2022-12-13 13:37:30,614 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 8661 transitions. Word has length 91 [2022-12-13 13:37:30,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:30,614 INFO L495 AbstractCegarLoop]: Abstraction has 6405 states and 8661 transitions. [2022-12-13 13:37:30,614 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 13:37:30,615 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 8661 transitions. [2022-12-13 13:37:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-13 13:37:30,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:30,617 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 13:37:30,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:37:30,617 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:30,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:30,618 INFO L85 PathProgramCache]: Analyzing trace with hash 913681156, now seen corresponding path program 1 times [2022-12-13 13:37:30,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:30,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612333347] [2022-12-13 13:37:30,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:30,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:30,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:37:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:30,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:37:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:37:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 13:37:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 13:37:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 13:37:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:30,665 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 13:37:30,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:30,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612333347] [2022-12-13 13:37:30,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612333347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:30,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:30,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:37:30,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885329725] [2022-12-13 13:37:30,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:30,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:37:30,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:30,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:37:30,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:37:30,667 INFO L87 Difference]: Start difference. First operand 6405 states and 8661 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 13:37:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:31,363 INFO L93 Difference]: Finished difference Result 8243 states and 10964 transitions. [2022-12-13 13:37:31,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:37:31,363 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 13:37:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:31,375 INFO L225 Difference]: With dead ends: 8243 [2022-12-13 13:37:31,376 INFO L226 Difference]: Without dead ends: 4804 [2022-12-13 13:37:31,380 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 13:37:31,381 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 502 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:31,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 619 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:37:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4804 states. [2022-12-13 13:37:31,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4804 to 4686. [2022-12-13 13:37:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4686 states, 3830 states have (on average 1.3671018276762401) internal successors, (5236), 3897 states have internal predecessors, (5236), 486 states have call successors, (486), 304 states have call predecessors, (486), 368 states have return successors, (700), 494 states have call predecessors, (700), 482 states have call successors, (700) [2022-12-13 13:37:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6422 transitions. [2022-12-13 13:37:31,737 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6422 transitions. Word has length 91 [2022-12-13 13:37:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:31,738 INFO L495 AbstractCegarLoop]: Abstraction has 4686 states and 6422 transitions. [2022-12-13 13:37:31,738 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 13:37:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6422 transitions. [2022-12-13 13:37:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-13 13:37:31,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:31,740 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 13:37:31,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:37:31,740 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:31,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:31,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1870290611, now seen corresponding path program 1 times [2022-12-13 13:37:31,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:31,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995434158] [2022-12-13 13:37:31,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:31,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:31,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:31,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:37:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:31,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:37:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:37:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 13:37:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:31,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 13:37:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 13:37:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:31,819 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 13:37:31,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:31,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995434158] [2022-12-13 13:37:31,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995434158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:31,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:31,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:37:31,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133009383] [2022-12-13 13:37:31,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:31,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:37:31,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:31,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:37:31,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:37:31,821 INFO L87 Difference]: Start difference. First operand 4686 states and 6422 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 13:37:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:33,175 INFO L93 Difference]: Finished difference Result 7512 states and 10024 transitions. [2022-12-13 13:37:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 13:37:33,175 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 13:37:33,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:33,186 INFO L225 Difference]: With dead ends: 7512 [2022-12-13 13:37:33,187 INFO L226 Difference]: Without dead ends: 5485 [2022-12-13 13:37:33,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-12-13 13:37:33,191 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 1806 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:33,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1839 Valid, 1014 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 13:37:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5485 states. [2022-12-13 13:37:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 5308. [2022-12-13 13:37:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5308 states, 4296 states have (on average 1.3424115456238361) internal successors, (5767), 4371 states have internal predecessors, (5767), 564 states have call successors, (564), 352 states have call predecessors, (564), 446 states have return successors, (833), 594 states have call predecessors, (833), 560 states have call successors, (833) [2022-12-13 13:37:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 7164 transitions. [2022-12-13 13:37:33,641 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 7164 transitions. Word has length 92 [2022-12-13 13:37:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:33,642 INFO L495 AbstractCegarLoop]: Abstraction has 5308 states and 7164 transitions. [2022-12-13 13:37:33,642 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 13:37:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 7164 transitions. [2022-12-13 13:37:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-13 13:37:33,646 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:33,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:37:33,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:37:33,647 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:33,647 INFO L85 PathProgramCache]: Analyzing trace with hash 56705439, now seen corresponding path program 1 times [2022-12-13 13:37:33,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:33,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261059268] [2022-12-13 13:37:33,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:33,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:33,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:33,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:33,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 13:37:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:33,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:33,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 13:37:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 13:37:33,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:33,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261059268] [2022-12-13 13:37:33,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261059268] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:33,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970752667] [2022-12-13 13:37:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:33,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:33,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:33,740 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:33,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:37:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:33,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:37:33,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 13:37:33,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:37:33,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970752667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:33,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:37:33,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:37:33,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839495000] [2022-12-13 13:37:33,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:33,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:37:33,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:33,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:37:33,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:33,856 INFO L87 Difference]: Start difference. First operand 5308 states and 7164 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 13:37:34,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:34,421 INFO L93 Difference]: Finished difference Result 11026 states and 15472 transitions. [2022-12-13 13:37:34,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:37:34,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2022-12-13 13:37:34,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:34,434 INFO L225 Difference]: With dead ends: 11026 [2022-12-13 13:37:34,434 INFO L226 Difference]: Without dead ends: 5838 [2022-12-13 13:37:34,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:34,442 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 153 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:34,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 829 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:37:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5838 states. [2022-12-13 13:37:34,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5838 to 5838. [2022-12-13 13:37:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5838 states, 4743 states have (on average 1.3487244360109636) internal successors, (6397), 4822 states have internal predecessors, (6397), 613 states have call successors, (613), 382 states have call predecessors, (613), 480 states have return successors, (911), 643 states have call predecessors, (911), 609 states have call successors, (911) [2022-12-13 13:37:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 7921 transitions. [2022-12-13 13:37:34,850 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 7921 transitions. Word has length 111 [2022-12-13 13:37:34,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:34,850 INFO L495 AbstractCegarLoop]: Abstraction has 5838 states and 7921 transitions. [2022-12-13 13:37:34,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 13:37:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 7921 transitions. [2022-12-13 13:37:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-13 13:37:34,854 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:34,855 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:34,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:37:35,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 13:37:35,055 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:35,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1296496829, now seen corresponding path program 1 times [2022-12-13 13:37:35,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:35,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718267210] [2022-12-13 13:37:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:35,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:35,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:35,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:35,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:35,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:35,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:35,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 13:37:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:35,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:35,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 13:37:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:35,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:35,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 13:37:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 13:37:35,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:35,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718267210] [2022-12-13 13:37:35,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718267210] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:35,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483073411] [2022-12-13 13:37:35,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:35,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:35,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:35,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:35,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:37:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:35,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:37:35,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 13:37:35,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:37:35,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483073411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:35,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:37:35,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 13:37:35,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983204007] [2022-12-13 13:37:35,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:35,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:37:35,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:35,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:37:35,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:35,361 INFO L87 Difference]: Start difference. First operand 5838 states and 7921 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 13:37:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:36,045 INFO L93 Difference]: Finished difference Result 12594 states and 17806 transitions. [2022-12-13 13:37:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:37:36,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2022-12-13 13:37:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:36,064 INFO L225 Difference]: With dead ends: 12594 [2022-12-13 13:37:36,064 INFO L226 Difference]: Without dead ends: 9121 [2022-12-13 13:37:36,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:36,073 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 252 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 518 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 13:37:36,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 518 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:37:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9121 states. [2022-12-13 13:37:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9121 to 9051. [2022-12-13 13:37:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9051 states, 7446 states have (on average 1.3759065269943593) internal successors, (10245), 7568 states have internal predecessors, (10245), 905 states have call successors, (905), 572 states have call predecessors, (905), 698 states have return successors, (1355), 920 states have call predecessors, (1355), 901 states have call successors, (1355) [2022-12-13 13:37:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9051 states to 9051 states and 12505 transitions. [2022-12-13 13:37:37,077 INFO L78 Accepts]: Start accepts. Automaton has 9051 states and 12505 transitions. Word has length 143 [2022-12-13 13:37:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:37,077 INFO L495 AbstractCegarLoop]: Abstraction has 9051 states and 12505 transitions. [2022-12-13 13:37:37,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 13:37:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 9051 states and 12505 transitions. [2022-12-13 13:37:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-13 13:37:37,083 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:37,084 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:37,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 13:37:37,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 13:37:37,285 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:37,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:37,286 INFO L85 PathProgramCache]: Analyzing trace with hash 2080420097, now seen corresponding path program 1 times [2022-12-13 13:37:37,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:37,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265092726] [2022-12-13 13:37:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:37,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:37,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:37,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:37,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:37,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:37,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 13:37:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:37,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:37,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 13:37:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:37,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:37,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 13:37:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 13:37:37,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:37,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265092726] [2022-12-13 13:37:37,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265092726] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:37,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975937093] [2022-12-13 13:37:37,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:37,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:37,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:37,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:37,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:37:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:37,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:37:37,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 13:37:37,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:37:37,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975937093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:37,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:37:37,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 13:37:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443444304] [2022-12-13 13:37:37,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:37,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:37:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:37,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:37:37,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:37,597 INFO L87 Difference]: Start difference. First operand 9051 states and 12505 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 13:37:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:38,654 INFO L93 Difference]: Finished difference Result 16387 states and 23265 transitions. [2022-12-13 13:37:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:37:38,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2022-12-13 13:37:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:38,682 INFO L225 Difference]: With dead ends: 16387 [2022-12-13 13:37:38,682 INFO L226 Difference]: Without dead ends: 12177 [2022-12-13 13:37:38,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:38,698 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 253 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:38,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 538 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:37:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2022-12-13 13:37:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12077. [2022-12-13 13:37:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12077 states, 9997 states have (on average 1.3899169750925278) internal successors, (13895), 10153 states have internal predecessors, (13895), 1181 states have call successors, (1181), 747 states have call predecessors, (1181), 897 states have return successors, (1750), 1186 states have call predecessors, (1750), 1177 states have call successors, (1750) [2022-12-13 13:37:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12077 states to 12077 states and 16826 transitions. [2022-12-13 13:37:39,615 INFO L78 Accepts]: Start accepts. Automaton has 12077 states and 16826 transitions. Word has length 143 [2022-12-13 13:37:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:39,615 INFO L495 AbstractCegarLoop]: Abstraction has 12077 states and 16826 transitions. [2022-12-13 13:37:39,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 13:37:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 12077 states and 16826 transitions. [2022-12-13 13:37:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 13:37:39,623 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:39,623 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 13:37:39,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:37:39,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:39,824 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:39,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:39,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1194272178, now seen corresponding path program 1 times [2022-12-13 13:37:39,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:39,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637910437] [2022-12-13 13:37:39,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:39,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:37:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:37:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:37:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 13:37:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 13:37:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 13:37:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 13:37:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 13:37:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:37:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:37:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:37:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-12-13 13:37:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 13:37:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 13:37:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 13:37:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:39,949 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 13:37:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:39,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637910437] [2022-12-13 13:37:39,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637910437] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:39,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452041868] [2022-12-13 13:37:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:39,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:39,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:39,950 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:39,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:37:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:40,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:37:40,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:40,130 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 13:37:40,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:37:40,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452041868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:40,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:37:40,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 13:37:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245538652] [2022-12-13 13:37:40,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:40,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:37:40,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:40,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:37:40,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:37:40,131 INFO L87 Difference]: Start difference. First operand 12077 states and 16826 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 13:37:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:41,118 INFO L93 Difference]: Finished difference Result 16402 states and 22141 transitions. [2022-12-13 13:37:41,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:37:41,118 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 13:37:41,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:41,149 INFO L225 Difference]: With dead ends: 16402 [2022-12-13 13:37:41,149 INFO L226 Difference]: Without dead ends: 14214 [2022-12-13 13:37:41,156 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 13:37:41,156 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 61 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:37:41,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 671 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:37:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14214 states. [2022-12-13 13:37:42,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14214 to 14169. [2022-12-13 13:37:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14169 states, 11622 states have (on average 1.3631905007743934) internal successors, (15843), 11807 states have internal predecessors, (15843), 1415 states have call successors, (1415), 929 states have call predecessors, (1415), 1130 states have return successors, (2057), 1442 states have call predecessors, (2057), 1411 states have call successors, (2057) [2022-12-13 13:37:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14169 states to 14169 states and 19315 transitions. [2022-12-13 13:37:42,139 INFO L78 Accepts]: Start accepts. Automaton has 14169 states and 19315 transitions. Word has length 163 [2022-12-13 13:37:42,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:42,139 INFO L495 AbstractCegarLoop]: Abstraction has 14169 states and 19315 transitions. [2022-12-13 13:37:42,139 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 13:37:42,139 INFO L276 IsEmpty]: Start isEmpty. Operand 14169 states and 19315 transitions. [2022-12-13 13:37:42,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-13 13:37:42,147 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:42,147 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, 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] [2022-12-13 13:37:42,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 13:37:42,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:42,349 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash 746982758, now seen corresponding path program 1 times [2022-12-13 13:37:42,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:42,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830057601] [2022-12-13 13:37:42,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 13:37:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 13:37:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 13:37:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 13:37:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-13 13:37:42,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:42,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830057601] [2022-12-13 13:37:42,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830057601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:42,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206523285] [2022-12-13 13:37:42,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:42,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:42,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:42,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:42,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:37:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:42,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:37:42,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 13:37:42,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:37:42,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206523285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:42,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:37:42,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:37:42,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286680615] [2022-12-13 13:37:42,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:42,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:37:42,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:42,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:37:42,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:42,658 INFO L87 Difference]: Start difference. First operand 14169 states and 19315 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 13:37:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:43,608 INFO L93 Difference]: Finished difference Result 22989 states and 31923 transitions. [2022-12-13 13:37:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:37:43,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-12-13 13:37:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:43,636 INFO L225 Difference]: With dead ends: 22989 [2022-12-13 13:37:43,636 INFO L226 Difference]: Without dead ends: 13278 [2022-12-13 13:37:43,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:43,651 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 272 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 369 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 13:37:43,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 369 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:37:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13278 states. [2022-12-13 13:37:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13278 to 13278. [2022-12-13 13:37:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13278 states, 10936 states have (on average 1.3204096561814191) internal successors, (14440), 11085 states have internal predecessors, (14440), 1263 states have call successors, (1263), 892 states have call predecessors, (1263), 1077 states have return successors, (1782), 1310 states have call predecessors, (1782), 1259 states have call successors, (1782) [2022-12-13 13:37:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13278 states to 13278 states and 17485 transitions. [2022-12-13 13:37:44,805 INFO L78 Accepts]: Start accepts. Automaton has 13278 states and 17485 transitions. Word has length 160 [2022-12-13 13:37:44,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:44,805 INFO L495 AbstractCegarLoop]: Abstraction has 13278 states and 17485 transitions. [2022-12-13 13:37:44,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 13:37:44,805 INFO L276 IsEmpty]: Start isEmpty. Operand 13278 states and 17485 transitions. [2022-12-13 13:37:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-13 13:37:44,813 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:44,813 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, 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 13:37:44,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 13:37:45,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:45,015 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1605594576, now seen corresponding path program 1 times [2022-12-13 13:37:45,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:45,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619729340] [2022-12-13 13:37:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:45,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 13:37:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 13:37:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 13:37:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 13:37:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-13 13:37:45,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:45,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619729340] [2022-12-13 13:37:45,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619729340] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:45,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612510797] [2022-12-13 13:37:45,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:45,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:45,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:45,132 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:45,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:37:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:45,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:37:45,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 13:37:45,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:37:45,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612510797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:45,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:37:45,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:37:45,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095903751] [2022-12-13 13:37:45,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:45,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:37:45,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:45,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:37:45,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:45,244 INFO L87 Difference]: Start difference. First operand 13278 states and 17485 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 13:37:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:46,388 INFO L93 Difference]: Finished difference Result 22874 states and 30536 transitions. [2022-12-13 13:37:46,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:37:46,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 160 [2022-12-13 13:37:46,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:46,413 INFO L225 Difference]: With dead ends: 22874 [2022-12-13 13:37:46,413 INFO L226 Difference]: Without dead ends: 14054 [2022-12-13 13:37:46,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:46,427 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 299 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 527 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 13:37:46,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 527 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:37:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14054 states. [2022-12-13 13:37:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14054 to 13909. [2022-12-13 13:37:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13909 states, 11526 states have (on average 1.2980218636127017) internal successors, (14961), 11670 states have internal predecessors, (14961), 1262 states have call successors, (1262), 931 states have call predecessors, (1262), 1119 states have return successors, (1767), 1317 states have call predecessors, (1767), 1258 states have call successors, (1767) [2022-12-13 13:37:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13909 states to 13909 states and 17990 transitions. [2022-12-13 13:37:47,755 INFO L78 Accepts]: Start accepts. Automaton has 13909 states and 17990 transitions. Word has length 160 [2022-12-13 13:37:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:47,755 INFO L495 AbstractCegarLoop]: Abstraction has 13909 states and 17990 transitions. [2022-12-13 13:37:47,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 13:37:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13909 states and 17990 transitions. [2022-12-13 13:37:47,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 13:37:47,766 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:47,767 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 13:37:47,771 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 13:37:47,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 13:37:47,968 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash 522982663, now seen corresponding path program 1 times [2022-12-13 13:37:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:47,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000415075] [2022-12-13 13:37:47,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:47,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 13:37:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 13:37:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 13:37:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 13:37:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-13 13:37:48,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:48,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000415075] [2022-12-13 13:37:48,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000415075] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:48,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066647451] [2022-12-13 13:37:48,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:48,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:48,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:48,114 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:48,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:37:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:48,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:37:48,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 13:37:48,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:37:48,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066647451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:48,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:37:48,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:37:48,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345464355] [2022-12-13 13:37:48,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:48,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:37:48,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:48,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:37:48,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:48,231 INFO L87 Difference]: Start difference. First operand 13909 states and 17990 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 13:37:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:49,949 INFO L93 Difference]: Finished difference Result 31048 states and 41157 transitions. [2022-12-13 13:37:49,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:37:49,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2022-12-13 13:37:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:49,992 INFO L225 Difference]: With dead ends: 31048 [2022-12-13 13:37:49,992 INFO L226 Difference]: Without dead ends: 21597 [2022-12-13 13:37:50,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:50,006 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 152 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 821 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 13:37:50,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 821 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:37:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21597 states. [2022-12-13 13:37:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21597 to 21593. [2022-12-13 13:37:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21593 states, 18019 states have (on average 1.3083411954048505) internal successors, (23575), 18243 states have internal predecessors, (23575), 1917 states have call successors, (1917), 1400 states have call predecessors, (1917), 1655 states have return successors, (2930), 1967 states have call predecessors, (2930), 1913 states have call successors, (2930) [2022-12-13 13:37:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21593 states to 21593 states and 28422 transitions. [2022-12-13 13:37:51,909 INFO L78 Accepts]: Start accepts. Automaton has 21593 states and 28422 transitions. Word has length 161 [2022-12-13 13:37:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:51,910 INFO L495 AbstractCegarLoop]: Abstraction has 21593 states and 28422 transitions. [2022-12-13 13:37:51,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 13:37:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21593 states and 28422 transitions. [2022-12-13 13:37:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 13:37:51,929 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:51,929 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, 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 13:37:51,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 13:37:52,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 13:37:52,131 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash 675676757, now seen corresponding path program 1 times [2022-12-13 13:37:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:52,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762670554] [2022-12-13 13:37:52,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:52,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 13:37:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 13:37:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 13:37:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 13:37:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-12-13 13:37:52,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:52,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762670554] [2022-12-13 13:37:52,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762670554] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:52,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129808743] [2022-12-13 13:37:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:52,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:52,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:37:52,251 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:52,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 13:37:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:52,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:37:52,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 13:37:52,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:37:52,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129808743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:52,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:37:52,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:37:52,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49945764] [2022-12-13 13:37:52,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:52,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:37:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:52,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:37:52,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:52,373 INFO L87 Difference]: Start difference. First operand 21593 states and 28422 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 13:37:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:37:55,363 INFO L93 Difference]: Finished difference Result 55172 states and 74382 transitions. [2022-12-13 13:37:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:37:55,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2022-12-13 13:37:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:37:55,455 INFO L225 Difference]: With dead ends: 55172 [2022-12-13 13:37:55,455 INFO L226 Difference]: Without dead ends: 38041 [2022-12-13 13:37:55,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:37:55,480 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 298 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 553 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 13:37:55,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 553 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:37:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38041 states. [2022-12-13 13:37:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38041 to 37835. [2022-12-13 13:37:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37835 states, 31807 states have (on average 1.3086741912157702) internal successors, (41625), 32191 states have internal predecessors, (41625), 3247 states have call successors, (3247), 2396 states have call predecessors, (3247), 2779 states have return successors, (5969), 3281 states have call predecessors, (5969), 3243 states have call successors, (5969) [2022-12-13 13:37:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37835 states to 37835 states and 50841 transitions. [2022-12-13 13:37:58,901 INFO L78 Accepts]: Start accepts. Automaton has 37835 states and 50841 transitions. Word has length 161 [2022-12-13 13:37:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:37:58,901 INFO L495 AbstractCegarLoop]: Abstraction has 37835 states and 50841 transitions. [2022-12-13 13:37:58,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (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 13:37:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 37835 states and 50841 transitions. [2022-12-13 13:37:58,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 13:37:58,927 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:37:58,927 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, 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] [2022-12-13 13:37:58,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 13:37:59,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 13:37:59,130 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:37:59,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:59,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1567842387, now seen corresponding path program 1 times [2022-12-13 13:37:59,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:59,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281945941] [2022-12-13 13:37:59,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:59,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:59,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:37:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:59,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:37:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:59,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:37:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:59,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:37:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:59,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:37:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:59,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 13:37:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:59,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 13:37:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:59,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:59,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 13:37:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:59,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:37:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:59,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 13:37:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-12-13 13:37:59,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:59,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281945941] [2022-12-13 13:37:59,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281945941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:59,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:59,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:37:59,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195734804] [2022-12-13 13:37:59,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:59,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:37:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:59,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:37:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:37:59,201 INFO L87 Difference]: Start difference. First operand 37835 states and 50841 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 13:38:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:02,381 INFO L93 Difference]: Finished difference Result 67330 states and 90844 transitions. [2022-12-13 13:38:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:38:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2022-12-13 13:38:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:02,450 INFO L225 Difference]: With dead ends: 67330 [2022-12-13 13:38:02,450 INFO L226 Difference]: Without dead ends: 33955 [2022-12-13 13:38:02,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:38:02,491 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 445 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:38:02,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 554 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 13:38:02,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33955 states. [2022-12-13 13:38:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33955 to 31775. [2022-12-13 13:38:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31775 states, 26625 states have (on average 1.307680751173709) internal successors, (34817), 27174 states have internal predecessors, (34817), 2569 states have call successors, (2569), 1888 states have call predecessors, (2569), 2579 states have return successors, (5056), 2730 states have call predecessors, (5056), 2565 states have call successors, (5056) [2022-12-13 13:38:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31775 states to 31775 states and 42442 transitions. [2022-12-13 13:38:05,587 INFO L78 Accepts]: Start accepts. Automaton has 31775 states and 42442 transitions. Word has length 161 [2022-12-13 13:38:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:05,588 INFO L495 AbstractCegarLoop]: Abstraction has 31775 states and 42442 transitions. [2022-12-13 13:38:05,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 13:38:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 31775 states and 42442 transitions. [2022-12-13 13:38:05,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 13:38:05,613 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:05,613 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, 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 13:38:05,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 13:38:05,613 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:05,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash -423691555, now seen corresponding path program 1 times [2022-12-13 13:38:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:05,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674392176] [2022-12-13 13:38:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:05,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:38:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:38:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:38:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:38:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:38:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:38:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 13:38:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 13:38:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 13:38:05,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:05,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674392176] [2022-12-13 13:38:05,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674392176] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:05,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085557858] [2022-12-13 13:38:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:05,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:05,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:38:05,714 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:38:05,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 13:38:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:05,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:38:05,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 13:38:05,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:38:05,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085557858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:05,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:38:05,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:38:05,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440950539] [2022-12-13 13:38:05,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:05,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:38:05,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:05,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:38:05,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:38:05,833 INFO L87 Difference]: Start difference. First operand 31775 states and 42442 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 13:38:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:08,579 INFO L93 Difference]: Finished difference Result 50520 states and 69980 transitions. [2022-12-13 13:38:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:38:08,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-12-13 13:38:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:08,634 INFO L225 Difference]: With dead ends: 50520 [2022-12-13 13:38:08,635 INFO L226 Difference]: Without dead ends: 31859 [2022-12-13 13:38:08,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:38:08,659 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 141 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 755 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 13:38:08,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 755 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:38:08,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31859 states. [2022-12-13 13:38:11,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31859 to 31775. [2022-12-13 13:38:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31775 states, 26625 states have (on average 1.2862347417840376) internal successors, (34246), 27174 states have internal predecessors, (34246), 2569 states have call successors, (2569), 1888 states have call predecessors, (2569), 2579 states have return successors, (5056), 2730 states have call predecessors, (5056), 2565 states have call successors, (5056) [2022-12-13 13:38:11,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31775 states to 31775 states and 41871 transitions. [2022-12-13 13:38:11,459 INFO L78 Accepts]: Start accepts. Automaton has 31775 states and 41871 transitions. Word has length 163 [2022-12-13 13:38:11,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:11,459 INFO L495 AbstractCegarLoop]: Abstraction has 31775 states and 41871 transitions. [2022-12-13 13:38:11,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 13:38:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 31775 states and 41871 transitions. [2022-12-13 13:38:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 13:38:11,481 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:11,481 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, 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] [2022-12-13 13:38:11,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 13:38:11,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 13:38:11,682 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:11,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:11,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1271742787, now seen corresponding path program 1 times [2022-12-13 13:38:11,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:11,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292261923] [2022-12-13 13:38:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:11,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:38:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:38:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:38:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:38:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:38:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:38:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 13:38:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 13:38:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 13:38:11,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:11,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292261923] [2022-12-13 13:38:11,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292261923] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:11,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508627263] [2022-12-13 13:38:11,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:11,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:11,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:38:11,795 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:38:11,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 13:38:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:11,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:38:11,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:11,904 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 13:38:11,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:38:11,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508627263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:11,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:38:11,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:38:11,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584055465] [2022-12-13 13:38:11,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:11,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:38:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:11,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:38:11,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:38:11,905 INFO L87 Difference]: Start difference. First operand 31775 states and 41871 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 13:38:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:14,937 INFO L93 Difference]: Finished difference Result 54728 states and 74324 transitions. [2022-12-13 13:38:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:38:14,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2022-12-13 13:38:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:15,000 INFO L225 Difference]: With dead ends: 54728 [2022-12-13 13:38:15,000 INFO L226 Difference]: Without dead ends: 30957 [2022-12-13 13:38:15,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:38:15,037 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 285 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 365 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 13:38:15,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 365 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:38:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30957 states. [2022-12-13 13:38:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30957 to 22939. [2022-12-13 13:38:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22939 states, 19187 states have (on average 1.2382342210871944) internal successors, (23758), 19563 states have internal predecessors, (23758), 1865 states have call successors, (1865), 1390 states have call predecessors, (1865), 1885 states have return successors, (3347), 1995 states have call predecessors, (3347), 1861 states have call successors, (3347) [2022-12-13 13:38:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22939 states to 22939 states and 28970 transitions. [2022-12-13 13:38:17,376 INFO L78 Accepts]: Start accepts. Automaton has 22939 states and 28970 transitions. Word has length 163 [2022-12-13 13:38:17,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:17,376 INFO L495 AbstractCegarLoop]: Abstraction has 22939 states and 28970 transitions. [2022-12-13 13:38:17,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 13:38:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 22939 states and 28970 transitions. [2022-12-13 13:38:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 13:38:17,387 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:17,387 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, 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] [2022-12-13 13:38:17,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 13:38:17,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 13:38:17,588 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:17,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:17,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1192837573, now seen corresponding path program 1 times [2022-12-13 13:38:17,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:17,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751441479] [2022-12-13 13:38:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:17,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:38:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:38:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:38:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:38:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:38:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:38:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 13:38:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 13:38:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 13:38:17,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:17,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751441479] [2022-12-13 13:38:17,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751441479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:17,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691910952] [2022-12-13 13:38:17,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:17,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:17,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:38:17,677 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:38:17,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 13:38:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:17,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:38:17,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 13:38:17,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:38:17,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691910952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:17,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:38:17,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 13:38:17,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852854301] [2022-12-13 13:38:17,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:17,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:38:17,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:17,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:38:17,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:38:17,843 INFO L87 Difference]: Start difference. First operand 22939 states and 28970 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 13:38:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:20,542 INFO L93 Difference]: Finished difference Result 41372 states and 52881 transitions. [2022-12-13 13:38:20,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:38:20,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 13:38:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:20,577 INFO L225 Difference]: With dead ends: 41372 [2022-12-13 13:38:20,577 INFO L226 Difference]: Without dead ends: 22891 [2022-12-13 13:38:20,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:38:20,594 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 376 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:38:20,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 510 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:38:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22891 states. [2022-12-13 13:38:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22891 to 22891. [2022-12-13 13:38:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22891 states, 19139 states have (on average 1.2137520246616855) internal successors, (23230), 19515 states have internal predecessors, (23230), 1865 states have call successors, (1865), 1390 states have call predecessors, (1865), 1885 states have return successors, (3347), 1995 states have call predecessors, (3347), 1861 states have call successors, (3347) [2022-12-13 13:38:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22891 states to 22891 states and 28442 transitions. [2022-12-13 13:38:22,912 INFO L78 Accepts]: Start accepts. Automaton has 22891 states and 28442 transitions. Word has length 165 [2022-12-13 13:38:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:22,912 INFO L495 AbstractCegarLoop]: Abstraction has 22891 states and 28442 transitions. [2022-12-13 13:38:22,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 13:38:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 22891 states and 28442 transitions. [2022-12-13 13:38:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 13:38:22,922 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:22,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, 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] [2022-12-13 13:38:22,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 13:38:23,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 13:38:23,124 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:23,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:23,124 INFO L85 PathProgramCache]: Analyzing trace with hash 100202371, now seen corresponding path program 1 times [2022-12-13 13:38:23,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:23,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599529110] [2022-12-13 13:38:23,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:23,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:38:23,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:38:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:38:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:38:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:38:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:38:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 13:38:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 13:38:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 13:38:23,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:23,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599529110] [2022-12-13 13:38:23,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599529110] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:23,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123444890] [2022-12-13 13:38:23,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:23,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:23,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:38:23,232 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:38:23,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 13:38:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:23,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:38:23,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 13:38:23,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:38:23,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123444890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:23,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:38:23,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 13:38:23,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552598394] [2022-12-13 13:38:23,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:23,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:38:23,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:23,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:38:23,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:38:23,370 INFO L87 Difference]: Start difference. First operand 22891 states and 28442 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 13:38:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:26,277 INFO L93 Difference]: Finished difference Result 40204 states and 51213 transitions. [2022-12-13 13:38:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:38:26,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 13:38:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:26,315 INFO L225 Difference]: With dead ends: 40204 [2022-12-13 13:38:26,316 INFO L226 Difference]: Without dead ends: 22497 [2022-12-13 13:38:26,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:38:26,340 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 404 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:38:26,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 504 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:38:26,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22497 states. [2022-12-13 13:38:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22497 to 20464. [2022-12-13 13:38:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20464 states, 17096 states have (on average 1.1868858212447355) internal successors, (20291), 17424 states have internal predecessors, (20291), 1673 states have call successors, (1673), 1250 states have call predecessors, (1673), 1693 states have return successors, (2867), 1795 states have call predecessors, (2867), 1669 states have call successors, (2867) [2022-12-13 13:38:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20464 states to 20464 states and 24831 transitions. [2022-12-13 13:38:28,526 INFO L78 Accepts]: Start accepts. Automaton has 20464 states and 24831 transitions. Word has length 165 [2022-12-13 13:38:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:28,527 INFO L495 AbstractCegarLoop]: Abstraction has 20464 states and 24831 transitions. [2022-12-13 13:38:28,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 13:38:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 20464 states and 24831 transitions. [2022-12-13 13:38:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 13:38:28,534 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:28,534 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, 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] [2022-12-13 13:38:28,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 13:38:28,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 13:38:28,735 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1742273343, now seen corresponding path program 1 times [2022-12-13 13:38:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:28,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644160725] [2022-12-13 13:38:28,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:28,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:38:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:38:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:38:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:38:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:38:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:38:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 13:38:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 13:38:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 13:38:28,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:28,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644160725] [2022-12-13 13:38:28,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644160725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:28,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851647909] [2022-12-13 13:38:28,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:28,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:28,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:38:28,839 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:38:28,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 13:38:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:28,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:38:28,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 13:38:28,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:38:28,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851647909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:28,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:38:28,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 13:38:28,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136457738] [2022-12-13 13:38:28,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:28,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:38:28,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:28,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:38:28,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:38:28,955 INFO L87 Difference]: Start difference. First operand 20464 states and 24831 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 13:38:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:31,849 INFO L93 Difference]: Finished difference Result 36204 states and 44667 transitions. [2022-12-13 13:38:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:38:31,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 13:38:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:31,885 INFO L225 Difference]: With dead ends: 36204 [2022-12-13 13:38:31,885 INFO L226 Difference]: Without dead ends: 20200 [2022-12-13 13:38:31,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:38:31,910 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 49 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:38:31,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1314 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:38:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20200 states. [2022-12-13 13:38:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20200 to 19820. [2022-12-13 13:38:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19820 states, 16477 states have (on average 1.171997329610973) internal successors, (19311), 16788 states have internal predecessors, (19311), 1673 states have call successors, (1673), 1250 states have call predecessors, (1673), 1668 states have return successors, (2727), 1787 states have call predecessors, (2727), 1669 states have call successors, (2727) [2022-12-13 13:38:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19820 states to 19820 states and 23711 transitions. [2022-12-13 13:38:34,364 INFO L78 Accepts]: Start accepts. Automaton has 19820 states and 23711 transitions. Word has length 165 [2022-12-13 13:38:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:34,364 INFO L495 AbstractCegarLoop]: Abstraction has 19820 states and 23711 transitions. [2022-12-13 13:38:34,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 13:38:34,364 INFO L276 IsEmpty]: Start isEmpty. Operand 19820 states and 23711 transitions. [2022-12-13 13:38:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 13:38:34,371 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:34,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, 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] [2022-12-13 13:38:34,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 13:38:34,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:34,572 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:34,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:34,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1910661765, now seen corresponding path program 1 times [2022-12-13 13:38:34,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:34,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946513008] [2022-12-13 13:38:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:34,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:38:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:38:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:38:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:38:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 13:38:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:38:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 13:38:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 13:38:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-13 13:38:34,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:34,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946513008] [2022-12-13 13:38:34,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946513008] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:34,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945990480] [2022-12-13 13:38:34,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:34,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:34,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:38:34,672 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:38:34,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 13:38:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:34,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:38:34,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-13 13:38:34,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:38:34,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945990480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:34,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:38:34,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 13:38:34,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268820746] [2022-12-13 13:38:34,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:34,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:38:34,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:34,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:38:34,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:38:34,782 INFO L87 Difference]: Start difference. First operand 19820 states and 23711 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 13:38:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:36,604 INFO L93 Difference]: Finished difference Result 29556 states and 35690 transitions. [2022-12-13 13:38:36,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:38:36,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 13:38:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:36,625 INFO L225 Difference]: With dead ends: 29556 [2022-12-13 13:38:36,625 INFO L226 Difference]: Without dead ends: 14193 [2022-12-13 13:38:36,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:38:36,638 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 10 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:38:36,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:38:36,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14193 states. [2022-12-13 13:38:38,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14193 to 14137. [2022-12-13 13:38:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14137 states, 11744 states have (on average 1.1673194822888284) internal successors, (13709), 11906 states have internal predecessors, (13709), 1230 states have call successors, (1230), 914 states have call predecessors, (1230), 1161 states have return successors, (1768), 1320 states have call predecessors, (1768), 1226 states have call successors, (1768) [2022-12-13 13:38:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14137 states to 14137 states and 16707 transitions. [2022-12-13 13:38:38,169 INFO L78 Accepts]: Start accepts. Automaton has 14137 states and 16707 transitions. Word has length 165 [2022-12-13 13:38:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:38,169 INFO L495 AbstractCegarLoop]: Abstraction has 14137 states and 16707 transitions. [2022-12-13 13:38:38,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 13:38:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 14137 states and 16707 transitions. [2022-12-13 13:38:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-13 13:38:38,175 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:38,175 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 13:38:38,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 13:38:38,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:38,376 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:38,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1582737387, now seen corresponding path program 1 times [2022-12-13 13:38:38,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:38,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815114697] [2022-12-13 13:38:38,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:38,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:38:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:38:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:38:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:38:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 13:38:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 13:38:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 13:38:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 13:38:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 13:38:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:38:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:38:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 13:38:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 13:38:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 13:38:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:38:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:38:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-12-13 13:38:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-12-13 13:38:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,522 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 13:38:38,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:38,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815114697] [2022-12-13 13:38:38,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815114697] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:38,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531967212] [2022-12-13 13:38:38,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:38,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:38,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:38:38,523 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:38:38,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 13:38:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:38,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:38:38,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:38,732 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 13:38:38,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:38:38,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531967212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:38,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:38:38,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 13:38:38,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756522536] [2022-12-13 13:38:38,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:38,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:38:38,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:38,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:38:38,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:38:38,734 INFO L87 Difference]: Start difference. First operand 14137 states and 16707 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 13:38:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:40,960 INFO L93 Difference]: Finished difference Result 23005 states and 27445 transitions. [2022-12-13 13:38:40,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:38:40,960 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 13:38:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:40,990 INFO L225 Difference]: With dead ends: 23005 [2022-12-13 13:38:40,990 INFO L226 Difference]: Without dead ends: 18571 [2022-12-13 13:38:41,001 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 13:38:41,001 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 52 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:38:41,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 645 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:38:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18571 states. [2022-12-13 13:38:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18571 to 18561. [2022-12-13 13:38:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18561 states, 15181 states have (on average 1.1741650747645083) internal successors, (17825), 15403 states have internal predecessors, (17825), 1730 states have call successors, (1730), 1278 states have call predecessors, (1730), 1648 states have return successors, (2461), 1883 states have call predecessors, (2461), 1726 states have call successors, (2461) [2022-12-13 13:38:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18561 states to 18561 states and 22016 transitions. [2022-12-13 13:38:43,202 INFO L78 Accepts]: Start accepts. Automaton has 18561 states and 22016 transitions. Word has length 195 [2022-12-13 13:38:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:43,202 INFO L495 AbstractCegarLoop]: Abstraction has 18561 states and 22016 transitions. [2022-12-13 13:38:43,202 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 13:38:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 18561 states and 22016 transitions. [2022-12-13 13:38:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-12-13 13:38:43,211 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:43,211 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 13:38:43,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 13:38:43,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-13 13:38:43,412 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:43,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1814836631, now seen corresponding path program 1 times [2022-12-13 13:38:43,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:43,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93430176] [2022-12-13 13:38:43,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:43,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:38:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 13:38:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:38:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 13:38:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-12-13 13:38:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 13:38:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-12-13 13:38:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 13:38:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 13:38:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 13:38:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:38:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 13:38:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 13:38:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 13:38:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 13:38:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 13:38:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-12-13 13:38:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-12-13 13:38:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,546 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 13:38:43,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:43,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93430176] [2022-12-13 13:38:43,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93430176] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:43,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177844915] [2022-12-13 13:38:43,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:43,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:43,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:38:43,547 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:38:43,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 13:38:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:43,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:38:43,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:43,745 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 13:38:43,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:38:43,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177844915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:43,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:38:43,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 13:38:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310141146] [2022-12-13 13:38:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:43,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:38:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:43,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:38:43,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:38:43,747 INFO L87 Difference]: Start difference. First operand 18561 states and 22016 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 13:38:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:45,681 INFO L93 Difference]: Finished difference Result 25091 states and 30256 transitions. [2022-12-13 13:38:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:38:45,682 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 13:38:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:45,696 INFO L225 Difference]: With dead ends: 25091 [2022-12-13 13:38:45,696 INFO L226 Difference]: Without dead ends: 9692 [2022-12-13 13:38:45,709 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 13:38:45,709 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:38:45,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 311 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:38:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9692 states. [2022-12-13 13:38:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9692 to 9692. [2022-12-13 13:38:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9692 states, 8295 states have (on average 1.1487643158529235) internal successors, (9529), 8394 states have internal predecessors, (9529), 722 states have call successors, (722), 549 states have call predecessors, (722), 674 states have return successors, (1068), 750 states have call predecessors, (1068), 720 states have call successors, (1068) [2022-12-13 13:38:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9692 states to 9692 states and 11319 transitions. [2022-12-13 13:38:46,853 INFO L78 Accepts]: Start accepts. Automaton has 9692 states and 11319 transitions. Word has length 195 [2022-12-13 13:38:46,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:46,853 INFO L495 AbstractCegarLoop]: Abstraction has 9692 states and 11319 transitions. [2022-12-13 13:38:46,853 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 13:38:46,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9692 states and 11319 transitions. [2022-12-13 13:38:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-13 13:38:46,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:46,858 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:46,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 13:38:47,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:47,059 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:47,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:47,060 INFO L85 PathProgramCache]: Analyzing trace with hash -55403990, now seen corresponding path program 1 times [2022-12-13 13:38:47,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:47,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604027686] [2022-12-13 13:38:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:47,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:38:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:38:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:38:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:38:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 13:38:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 13:38:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 13:38:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-12-13 13:38:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 13:38:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-12-13 13:38:47,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:47,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604027686] [2022-12-13 13:38:47,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604027686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:47,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015755660] [2022-12-13 13:38:47,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:47,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:47,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:38:47,168 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:38:47,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 13:38:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:47,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 13:38:47,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 13:38:47,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:38:47,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015755660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:47,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:38:47,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 13:38:47,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157537861] [2022-12-13 13:38:47,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:47,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:38:47,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:47,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:38:47,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:38:47,276 INFO L87 Difference]: Start difference. First operand 9692 states and 11319 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 13:38:47,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:47,827 INFO L93 Difference]: Finished difference Result 12798 states and 14928 transitions. [2022-12-13 13:38:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:38:47,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 200 [2022-12-13 13:38:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:47,832 INFO L225 Difference]: With dead ends: 12798 [2022-12-13 13:38:47,832 INFO L226 Difference]: Without dead ends: 2922 [2022-12-13 13:38:47,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:38:47,838 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 138 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:38:47,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 426 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:38:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-12-13 13:38:48,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2022-12-13 13:38:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2482 states have (on average 1.128928283642224) internal successors, (2802), 2504 states have internal predecessors, (2802), 247 states have call successors, (247), 176 states have call predecessors, (247), 192 states have return successors, (282), 243 states have call predecessors, (282), 245 states have call successors, (282) [2022-12-13 13:38:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3331 transitions. [2022-12-13 13:38:48,252 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3331 transitions. Word has length 200 [2022-12-13 13:38:48,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:48,252 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 3331 transitions. [2022-12-13 13:38:48,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 13:38:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3331 transitions. [2022-12-13 13:38:48,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-13 13:38:48,255 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:48,256 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:48,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 13:38:48,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:48,456 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:48,457 INFO L85 PathProgramCache]: Analyzing trace with hash 135104874, now seen corresponding path program 1 times [2022-12-13 13:38:48,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:48,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434093051] [2022-12-13 13:38:48,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:48,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:38:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:38:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:38:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:38:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 13:38:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 13:38:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 13:38:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-12-13 13:38:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-12-13 13:38:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 53 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-13 13:38:48,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:48,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434093051] [2022-12-13 13:38:48,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434093051] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:48,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213777899] [2022-12-13 13:38:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:48,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:48,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:38:48,561 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:38:48,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 13:38:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:48,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:38:48,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 13:38:48,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:38:48,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213777899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:48,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:38:48,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-13 13:38:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929260277] [2022-12-13 13:38:48,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:48,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:38:48,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:48,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:38:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:38:48,681 INFO L87 Difference]: Start difference. First operand 2922 states and 3331 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 13:38:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:49,201 INFO L93 Difference]: Finished difference Result 5145 states and 5903 transitions. [2022-12-13 13:38:49,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:38:49,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 201 [2022-12-13 13:38:49,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:49,205 INFO L225 Difference]: With dead ends: 5145 [2022-12-13 13:38:49,205 INFO L226 Difference]: Without dead ends: 2922 [2022-12-13 13:38:49,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:38:49,209 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 106 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:38:49,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 379 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:38:49,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-12-13 13:38:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2022-12-13 13:38:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2482 states have (on average 1.1180499597099114) internal successors, (2775), 2504 states have internal predecessors, (2775), 247 states have call successors, (247), 176 states have call predecessors, (247), 192 states have return successors, (282), 243 states have call predecessors, (282), 245 states have call successors, (282) [2022-12-13 13:38:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3304 transitions. [2022-12-13 13:38:49,642 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3304 transitions. Word has length 201 [2022-12-13 13:38:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:49,642 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 3304 transitions. [2022-12-13 13:38:49,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 13:38:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3304 transitions. [2022-12-13 13:38:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-12-13 13:38:49,644 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:49,645 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:49,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 13:38:49,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 13:38:49,846 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:49,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:49,847 INFO L85 PathProgramCache]: Analyzing trace with hash 171826558, now seen corresponding path program 1 times [2022-12-13 13:38:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:49,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708754112] [2022-12-13 13:38:49,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:49,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:38:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:49,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:49,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:38:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:49,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:38:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:38:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 13:38:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 13:38:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:49,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:49,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 13:38:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:50,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 13:38:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:50,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:50,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 13:38:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-12-13 13:38:50,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:50,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708754112] [2022-12-13 13:38:50,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708754112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:50,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:38:50,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:38:50,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680764676] [2022-12-13 13:38:50,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:50,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:38:50,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:50,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:38:50,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:38:50,014 INFO L87 Difference]: Start difference. First operand 2922 states and 3304 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 13:38:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:51,029 INFO L93 Difference]: Finished difference Result 3320 states and 3736 transitions. [2022-12-13 13:38:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:38:51,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2022-12-13 13:38:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:51,034 INFO L225 Difference]: With dead ends: 3320 [2022-12-13 13:38:51,034 INFO L226 Difference]: Without dead ends: 3317 [2022-12-13 13:38:51,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:38:51,035 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 712 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:38:51,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 823 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 13:38:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-12-13 13:38:51,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3086. [2022-12-13 13:38:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2621 states have (on average 1.1175123998473866) internal successors, (2929), 2643 states have internal predecessors, (2929), 261 states have call successors, (261), 186 states have call predecessors, (261), 203 states have return successors, (298), 258 states have call predecessors, (298), 260 states have call successors, (298) [2022-12-13 13:38:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 3488 transitions. [2022-12-13 13:38:51,388 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 3488 transitions. Word has length 203 [2022-12-13 13:38:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:51,388 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 3488 transitions. [2022-12-13 13:38:51,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 13:38:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 3488 transitions. [2022-12-13 13:38:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-13 13:38:51,390 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:51,390 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:51,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 13:38:51,391 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:51,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash -190863834, now seen corresponding path program 1 times [2022-12-13 13:38:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:51,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392446029] [2022-12-13 13:38:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:51,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 13:38:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 13:38:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 13:38:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 13:38:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 13:38:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 13:38:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 13:38:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 13:38:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 13:38:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 13:38:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 13:38:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-12-13 13:38:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:51,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392446029] [2022-12-13 13:38:51,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392446029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:38:51,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:38:51,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:38:51,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89716170] [2022-12-13 13:38:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:38:51,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:38:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:51,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:38:51,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:38:51,475 INFO L87 Difference]: Start difference. First operand 3086 states and 3488 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 13:38:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:38:52,198 INFO L93 Difference]: Finished difference Result 5135 states and 5909 transitions. [2022-12-13 13:38:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:38:52,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2022-12-13 13:38:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:38:52,204 INFO L225 Difference]: With dead ends: 5135 [2022-12-13 13:38:52,204 INFO L226 Difference]: Without dead ends: 3747 [2022-12-13 13:38:52,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:38:52,207 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 201 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:38:52,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 533 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:38:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2022-12-13 13:38:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 3089. [2022-12-13 13:38:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3089 states, 2624 states have (on average 1.1173780487804879) internal successors, (2932), 2646 states have internal predecessors, (2932), 261 states have call successors, (261), 186 states have call predecessors, (261), 203 states have return successors, (298), 258 states have call predecessors, (298), 260 states have call successors, (298) [2022-12-13 13:38:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 3491 transitions. [2022-12-13 13:38:52,566 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 3491 transitions. Word has length 207 [2022-12-13 13:38:52,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:38:52,566 INFO L495 AbstractCegarLoop]: Abstraction has 3089 states and 3491 transitions. [2022-12-13 13:38:52,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 13:38:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 3491 transitions. [2022-12-13 13:38:52,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-13 13:38:52,568 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:38:52,568 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:52,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 13:38:52,568 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 13:38:52,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:52,569 INFO L85 PathProgramCache]: Analyzing trace with hash -392769361, now seen corresponding path program 1 times [2022-12-13 13:38:52,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:52,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958804839] [2022-12-13 13:38:52,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:52,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:38:52,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:38:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:38:52,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:38:52,660 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:38:52,661 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 13:38:52,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 13:38:52,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 13:38:52,665 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] [2022-12-13 13:38:52,668 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:38:52,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:38:52 BoogieIcfgContainer [2022-12-13 13:38:52,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:38:52,800 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:38:52,800 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:38:52,800 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:38:52,800 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:37:13" (3/4) ... [2022-12-13 13:38:52,802 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 13:38:52,901 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:38:52,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:38:52,902 INFO L158 Benchmark]: Toolchain (without parser) took 100767.14ms. Allocated memory was 144.7MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 109.5MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-12-13 13:38:52,902 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 144.7MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:38:52,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.31ms. Allocated memory is still 144.7MB. Free memory was 109.5MB in the beginning and 91.2MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 13:38:52,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.98ms. Allocated memory is still 144.7MB. Free memory was 91.2MB in the beginning and 88.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:38:52,903 INFO L158 Benchmark]: Boogie Preprocessor took 43.79ms. Allocated memory is still 144.7MB. Free memory was 88.0MB in the beginning and 85.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 13:38:52,903 INFO L158 Benchmark]: RCFGBuilder took 541.19ms. Allocated memory is still 144.7MB. Free memory was 85.4MB in the beginning and 53.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-12-13 13:38:52,903 INFO L158 Benchmark]: TraceAbstraction took 99737.48ms. Allocated memory was 144.7MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 53.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-12-13 13:38:52,904 INFO L158 Benchmark]: Witness Printer took 102.17ms. Allocated memory is still 3.8GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 13:38:52,905 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.17ms. Allocated memory is still 144.7MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.31ms. Allocated memory is still 144.7MB. Free memory was 109.5MB in the beginning and 91.2MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.98ms. Allocated memory is still 144.7MB. Free memory was 91.2MB in the beginning and 88.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.79ms. Allocated memory is still 144.7MB. Free memory was 88.0MB in the beginning and 85.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 541.19ms. Allocated memory is still 144.7MB. Free memory was 85.4MB in the beginning and 53.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 99737.48ms. Allocated memory was 144.7MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 53.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 102.17ms. Allocated memory is still 3.8GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int t2_pc = 0; [L606] int m_st ; [L607] int t1_st ; [L608] int t2_st ; [L609] int m_i ; [L610] int t1_i ; [L611] int t2_i ; [L612] int M_E = 2; [L613] int T1_E = 2; [L614] int T2_E = 2; [L615] int E_M = 2; [L616] int E_1 = 2; [L617] int E_2 = 2; [L622] int token ; [L624] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1202] COND FALSE !(__VERIFIER_nondet_int()) [L1205] CALL main2() [L1189] int __retres1 ; [L1193] CALL init_model2() [L1103] m_i = 1 [L1104] t1_i = 1 [L1105] t2_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1193] RET init_model2() [L1194] CALL start_simulation2() [L1130] int kernel_st ; [L1131] int tmp ; [L1132] int tmp___0 ; [L1136] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1137] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1138] CALL init_threads2() [L822] COND TRUE m_i == 1 [L823] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L827] COND TRUE t1_i == 1 [L828] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L832] COND TRUE t2_i == 1 [L833] t2_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1138] RET init_threads2() [L1139] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L935] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L940] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L945] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L950] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L955] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L960] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1139] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1140] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L757] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L767] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L776] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L786] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L788] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L795] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L805] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L807] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1140] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1141] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L973] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L978] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L983] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L988] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L993] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L998] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1141] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1144] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1147] kernel_st = 1 [L1148] CALL eval2() [L868] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L872] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L845] COND TRUE m_st == 0 [L846] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L863] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] tmp = exists_runnable_thread2() [L877] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L696] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L698] t1_pc = 1 [L699] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L732] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L734] t2_pc = 1 [L735] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L916] RET transmit2() [L872] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, token=0] [L875] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L842] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L845] COND TRUE m_st == 0 [L846] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L863] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L875] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, token=0] [L875] tmp = exists_runnable_thread2() [L877] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, token=0] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L640] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L643] token = __VERIFIER_nondet_int() [L644] local = token [L645] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L646] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1046] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L757] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L767] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L769] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L777] COND TRUE E_1 == 1 [L778] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L788] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND TRUE \read(tmp___0) [L1025] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L796] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L805] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L807] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L1046] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L646] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L647] E_1 = 2 [L648] m_pc = 1 [L649] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L888] RET master() [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L688] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L704] token += 1 [L705] E_2 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L706] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1046] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L757] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L758] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L767] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L769] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L777] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L786] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L788] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L796] COND TRUE E_2 == 1 [L797] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L807] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND TRUE \read(tmp___1) [L1033] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L1046] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L706] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L707] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L696] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L698] t1_pc = 1 [L699] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L724] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L740] token += 1 [L741] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L742] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1046] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L757] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L758] COND TRUE E_M == 1 [L759] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L769] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND TRUE \read(tmp) [L1017] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L777] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L786] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L788] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L796] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L805] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L807] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L1046] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L742] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L743] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L732] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L734] t2_pc = 1 [L735] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L916] RET transmit2() [L872] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=4, tmp_ndt_3=-4, token=2] [L875] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L842] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L845] COND TRUE m_st == 0 [L846] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L863] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L875] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=4, tmp_ndt_3=-4, token=2] [L875] tmp = exists_runnable_thread2() [L877] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=4, tmp_ndt_3=-4, token=2] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L632] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L654] COND FALSE !(token != local + 2) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L659] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L660] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L665] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L666] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L667] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L668] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L599] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 257 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 99.5s, OverallIterations: 38, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 52.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20128 SdHoareTripleChecker+Valid, 10.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19745 mSDsluCounter, 31085 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20295 mSDsCounter, 3626 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18618 IncrementalHoareTripleChecker+Invalid, 22244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3626 mSolverCounterUnsat, 10790 mSDtfsCounter, 18618 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4190 GetRequests, 3764 SyntacticMatches, 4 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37835occurred in iteration=24, InterpolantAutomatonStates: 342, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 17467 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 7938 NumberOfCodeBlocks, 7938 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 7675 ConstructedInterpolants, 0 QuantifiedInterpolants, 13705 SizeOfPredicates, 6 NumberOfNonLiveVariables, 10138 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 55 InterpolantComputations, 37 PerfectInterpolantSequences, 4071/4403 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 13:38:52,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_490a5d20-0b11-4919-93f0-285691654747/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