./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b 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_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN --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 b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f --- 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-6b4ec56 [2022-11-20 11:53:38,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:53:38,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:53:38,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:53:38,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:53:38,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:53:38,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:53:38,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:53:38,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:53:38,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:53:38,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:53:38,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:53:38,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:53:38,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:53:38,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:53:38,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:53:38,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:53:38,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:53:38,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:53:38,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:53:38,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:53:38,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:53:38,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:53:38,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:53:38,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:53:38,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:53:38,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:53:38,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:53:38,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:53:38,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:53:38,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:53:38,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:53:38,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:53:38,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:53:38,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:53:38,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:53:38,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:53:38,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:53:38,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:53:38,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:53:38,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:53:38,672 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 11:53:38,717 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:53:38,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:53:38,718 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:53:38,719 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:53:38,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:53:38,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:53:38,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:53:38,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:53:38,721 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:53:38,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:53:38,723 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:53:38,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:53:38,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:53:38,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:53:38,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:53:38,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:53:38,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:53:38,724 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:53:38,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:53:38,725 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:53:38,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:53:38,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:53:38,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:53:38,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:53:38,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:53:38,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:53:38,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:53:38,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:53:38,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:53:38,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:53:38,728 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:53:38,728 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:53:38,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:53:38,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/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_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN 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 -> b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f [2022-11-20 11:53:39,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:53:39,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:53:39,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:53:39,109 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:53:39,110 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:53:39,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2022-11-20 11:53:42,604 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:53:42,802 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:53:42,803 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2022-11-20 11:53:42,819 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/data/d9b5a0901/c875309cfa1b47edab99b014085318cf/FLAGe15ebc430 [2022-11-20 11:53:42,840 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/data/d9b5a0901/c875309cfa1b47edab99b014085318cf [2022-11-20 11:53:42,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:53:42,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:53:42,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:53:42,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:53:42,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:53:42,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:53:42" (1/1) ... [2022-11-20 11:53:42,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c53878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:42, skipping insertion in model container [2022-11-20 11:53:42,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:53:42" (1/1) ... [2022-11-20 11:53:42,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:53:42,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:53:43,037 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_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-11-20 11:53:43,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:53:43,110 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:53:43,124 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_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-11-20 11:53:43,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:53:43,166 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:53:43,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43 WrapperNode [2022-11-20 11:53:43,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:53:43,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:53:43,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:53:43,168 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:53:43,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43" (1/1) ... [2022-11-20 11:53:43,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43" (1/1) ... [2022-11-20 11:53:43,210 INFO L138 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 187 [2022-11-20 11:53:43,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:53:43,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:53:43,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:53:43,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:53:43,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43" (1/1) ... [2022-11-20 11:53:43,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43" (1/1) ... [2022-11-20 11:53:43,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43" (1/1) ... [2022-11-20 11:53:43,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43" (1/1) ... [2022-11-20 11:53:43,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43" (1/1) ... [2022-11-20 11:53:43,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43" (1/1) ... [2022-11-20 11:53:43,238 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43" (1/1) ... [2022-11-20 11:53:43,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43" (1/1) ... [2022-11-20 11:53:43,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:53:43,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:53:43,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:53:43,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:53:43,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43" (1/1) ... [2022-11-20 11:53:43,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:53:43,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:53:43,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:53:43,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:53:43,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:53:43,340 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-20 11:53:43,340 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-20 11:53:43,341 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-20 11:53:43,341 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-20 11:53:43,341 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-20 11:53:43,341 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-20 11:53:43,341 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-20 11:53:43,342 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-20 11:53:43,342 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-20 11:53:43,342 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-20 11:53:43,342 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-20 11:53:43,342 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-20 11:53:43,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:53:43,343 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-20 11:53:43,343 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-20 11:53:43,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:53:43,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:53:43,343 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-20 11:53:43,344 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-20 11:53:43,439 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:53:43,442 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:53:43,845 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:53:43,860 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:53:43,860 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 11:53:43,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:53:43 BoogieIcfgContainer [2022-11-20 11:53:43,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:53:43,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:53:43,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:53:43,877 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:53:43,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:53:42" (1/3) ... [2022-11-20 11:53:43,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36559888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:53:43, skipping insertion in model container [2022-11-20 11:53:43,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:53:43" (2/3) ... [2022-11-20 11:53:43,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36559888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:53:43, skipping insertion in model container [2022-11-20 11:53:43,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:53:43" (3/3) ... [2022-11-20 11:53:43,888 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2022-11-20 11:53:43,919 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:53:43,919 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:53:44,043 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:53:44,051 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;@1d54d275, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:53:44,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:53:44,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-20 11:53:44,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 11:53:44,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:44,067 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] [2022-11-20 11:53:44,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:53:44,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:44,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1645662907, now seen corresponding path program 1 times [2022-11-20 11:53:44,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:44,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760852349] [2022-11-20 11:53:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:44,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:53:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:44,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:53:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:44,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:53:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:44,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:53:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:44,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:53:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:53:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:53:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:44,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:44,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760852349] [2022-11-20 11:53:44,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760852349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:53:44,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:53:44,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:53:44,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813968921] [2022-11-20 11:53:44,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:53:44,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:53:44,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:44,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:53:44,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:53:44,665 INFO L87 Difference]: Start difference. First operand has 103 states, 79 states have (on average 1.518987341772152) internal successors, (120), 83 states have internal predecessors, (120), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 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-11-20 11:53:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:45,291 INFO L93 Difference]: Finished difference Result 215 states and 313 transitions. [2022-11-20 11:53:45,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:53:45,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 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 64 [2022-11-20 11:53:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:45,313 INFO L225 Difference]: With dead ends: 215 [2022-11-20 11:53:45,314 INFO L226 Difference]: Without dead ends: 115 [2022-11-20 11:53:45,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:53:45,327 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 213 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:45,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 239 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:53:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-20 11:53:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2022-11-20 11:53:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4) internal successors, (105), 77 states have internal predecessors, (105), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-20 11:53:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2022-11-20 11:53:45,420 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 64 [2022-11-20 11:53:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:45,421 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2022-11-20 11:53:45,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 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-11-20 11:53:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2022-11-20 11:53:45,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 11:53:45,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:45,425 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] [2022-11-20 11:53:45,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:53:45,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:53:45,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:45,427 INFO L85 PathProgramCache]: Analyzing trace with hash 258877497, now seen corresponding path program 1 times [2022-11-20 11:53:45,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:45,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635699762] [2022-11-20 11:53:45,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:45,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:45,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:53:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:45,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:53:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:45,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:53:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:53:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:53:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:45,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:53:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:53:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:45,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635699762] [2022-11-20 11:53:45,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635699762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:53:45,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:53:45,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:53:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809422217] [2022-11-20 11:53:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:53:45,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:53:45,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:45,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:53:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:53:45,833 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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-11-20 11:53:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:46,582 INFO L93 Difference]: Finished difference Result 320 states and 445 transitions. [2022-11-20 11:53:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 11:53:46,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2022-11-20 11:53:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:46,591 INFO L225 Difference]: With dead ends: 320 [2022-11-20 11:53:46,591 INFO L226 Difference]: Without dead ends: 232 [2022-11-20 11:53:46,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:53:46,600 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 412 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:46,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 355 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:53:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-20 11:53:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 193. [2022-11-20 11:53:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 155 states have internal predecessors, (209), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2022-11-20 11:53:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 262 transitions. [2022-11-20 11:53:46,667 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 262 transitions. Word has length 64 [2022-11-20 11:53:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:46,668 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 262 transitions. [2022-11-20 11:53:46,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 5 states have internal predecessors, (49), 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-11-20 11:53:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 262 transitions. [2022-11-20 11:53:46,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 11:53:46,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:46,678 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] [2022-11-20 11:53:46,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:53:46,678 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:53:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:46,679 INFO L85 PathProgramCache]: Analyzing trace with hash 662663448, now seen corresponding path program 1 times [2022-11-20 11:53:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:46,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618172772] [2022-11-20 11:53:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:46,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:46,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:53:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:46,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:53:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:46,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:53:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:46,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:53:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:46,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:53:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:46,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:53:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:46,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:53:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:46,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:46,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618172772] [2022-11-20 11:53:46,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618172772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:53:46,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:53:46,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:53:46,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805408537] [2022-11-20 11:53:46,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:53:46,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:53:46,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:46,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:53:46,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:53:46,937 INFO L87 Difference]: Start difference. First operand 193 states and 262 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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-11-20 11:53:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:47,888 INFO L93 Difference]: Finished difference Result 540 states and 738 transitions. [2022-11-20 11:53:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 11:53:47,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2022-11-20 11:53:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:47,899 INFO L225 Difference]: With dead ends: 540 [2022-11-20 11:53:47,899 INFO L226 Difference]: Without dead ends: 363 [2022-11-20 11:53:47,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-20 11:53:47,913 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 452 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:47,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 580 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:53:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-11-20 11:53:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 289. [2022-11-20 11:53:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.3744493392070485) internal successors, (312), 233 states have internal predecessors, (312), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2022-11-20 11:53:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 395 transitions. [2022-11-20 11:53:48,009 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 395 transitions. Word has length 64 [2022-11-20 11:53:48,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:48,010 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 395 transitions. [2022-11-20 11:53:48,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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-11-20 11:53:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 395 transitions. [2022-11-20 11:53:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 11:53:48,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:48,012 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] [2022-11-20 11:53:48,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:53:48,013 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:53:48,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1365922662, now seen corresponding path program 1 times [2022-11-20 11:53:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:48,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231057446] [2022-11-20 11:53:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:48,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:48,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:53:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:48,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:53:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:48,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:53:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:53:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:48,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:53:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:48,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:53:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:48,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:53:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:48,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:48,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231057446] [2022-11-20 11:53:48,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231057446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:53:48,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:53:48,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 11:53:48,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367089886] [2022-11-20 11:53:48,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:53:48,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:53:48,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:48,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:53:48,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:53:48,286 INFO L87 Difference]: Start difference. First operand 289 states and 395 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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-11-20 11:53:48,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:48,929 INFO L93 Difference]: Finished difference Result 590 states and 809 transitions. [2022-11-20 11:53:48,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:53:48,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2022-11-20 11:53:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:48,934 INFO L225 Difference]: With dead ends: 590 [2022-11-20 11:53:48,935 INFO L226 Difference]: Without dead ends: 323 [2022-11-20 11:53:48,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-20 11:53:48,947 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 120 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:48,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 489 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:53:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-20 11:53:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 294. [2022-11-20 11:53:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 231 states have (on average 1.3593073593073592) internal successors, (314), 237 states have internal predecessors, (314), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2022-11-20 11:53:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 398 transitions. [2022-11-20 11:53:49,030 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 398 transitions. Word has length 64 [2022-11-20 11:53:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:49,030 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 398 transitions. [2022-11-20 11:53:49,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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-11-20 11:53:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 398 transitions. [2022-11-20 11:53:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 11:53:49,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:49,036 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] [2022-11-20 11:53:49,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:53:49,037 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:53:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1899685336, now seen corresponding path program 1 times [2022-11-20 11:53:49,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:49,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295579894] [2022-11-20 11:53:49,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:49,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:53:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:49,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:53:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:49,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:53:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:53:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:49,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:53:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:49,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:53:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:49,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:53:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:49,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:49,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:49,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295579894] [2022-11-20 11:53:49,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295579894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:53:49,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:53:49,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 11:53:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324399606] [2022-11-20 11:53:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:53:49,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:53:49,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:49,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:53:49,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:53:49,350 INFO L87 Difference]: Start difference. First operand 294 states and 398 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 11:53:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:51,591 INFO L93 Difference]: Finished difference Result 1956 states and 2670 transitions. [2022-11-20 11:53:51,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 11:53:51,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2022-11-20 11:53:51,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:51,606 INFO L225 Difference]: With dead ends: 1956 [2022-11-20 11:53:51,607 INFO L226 Difference]: Without dead ends: 1684 [2022-11-20 11:53:51,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 11:53:51,611 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 1195 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:51,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 746 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 11:53:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-11-20 11:53:51,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1434. [2022-11-20 11:53:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1131 states have (on average 1.3218390804597702) internal successors, (1495), 1157 states have internal predecessors, (1495), 153 states have call successors, (153), 124 states have call predecessors, (153), 149 states have return successors, (234), 155 states have call predecessors, (234), 151 states have call successors, (234) [2022-11-20 11:53:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1882 transitions. [2022-11-20 11:53:51,862 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1882 transitions. Word has length 64 [2022-11-20 11:53:51,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:51,863 INFO L495 AbstractCegarLoop]: Abstraction has 1434 states and 1882 transitions. [2022-11-20 11:53:51,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 11:53:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1882 transitions. [2022-11-20 11:53:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 11:53:51,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:51,866 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] [2022-11-20 11:53:51,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:53:51,866 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:53:51,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:51,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1343832871, now seen corresponding path program 1 times [2022-11-20 11:53:51,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:51,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544389292] [2022-11-20 11:53:51,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:51,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:53:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:51,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:53:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:51,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:53:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:52,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:53:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:53:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:52,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:53:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:52,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:53:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:52,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:52,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544389292] [2022-11-20 11:53:52,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544389292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:53:52,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:53:52,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 11:53:52,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263621186] [2022-11-20 11:53:52,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:53:52,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:53:52,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:52,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:53:52,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:53:52,082 INFO L87 Difference]: Start difference. First operand 1434 states and 1882 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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-11-20 11:53:52,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:52,792 INFO L93 Difference]: Finished difference Result 3035 states and 4006 transitions. [2022-11-20 11:53:52,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:53:52,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2022-11-20 11:53:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:52,806 INFO L225 Difference]: With dead ends: 3035 [2022-11-20 11:53:52,806 INFO L226 Difference]: Without dead ends: 1623 [2022-11-20 11:53:52,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-20 11:53:52,812 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 118 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:52,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 488 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:53:52,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2022-11-20 11:53:52,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1479. [2022-11-20 11:53:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1167 states have (on average 1.3041988003427591) internal successors, (1522), 1193 states have internal predecessors, (1522), 153 states have call successors, (153), 124 states have call predecessors, (153), 158 states have return successors, (246), 164 states have call predecessors, (246), 151 states have call successors, (246) [2022-11-20 11:53:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1921 transitions. [2022-11-20 11:53:52,985 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1921 transitions. Word has length 64 [2022-11-20 11:53:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:52,985 INFO L495 AbstractCegarLoop]: Abstraction has 1479 states and 1921 transitions. [2022-11-20 11:53:52,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 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-11-20 11:53:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1921 transitions. [2022-11-20 11:53:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 11:53:52,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:52,987 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] [2022-11-20 11:53:52,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:53:52,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:53:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash 42370523, now seen corresponding path program 1 times [2022-11-20 11:53:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:52,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441290344] [2022-11-20 11:53:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:52,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:53,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:53:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:53,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:53:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:53,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:53:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:53,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:53:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:53,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:53:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:53,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:53:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:53,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:53:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:53,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:53,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441290344] [2022-11-20 11:53:53,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441290344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:53:53,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:53:53,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:53:53,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853476158] [2022-11-20 11:53:53,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:53:53,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:53:53,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:53,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:53:53,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:53:53,152 INFO L87 Difference]: Start difference. First operand 1479 states and 1921 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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-11-20 11:53:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:54,020 INFO L93 Difference]: Finished difference Result 2914 states and 3760 transitions. [2022-11-20 11:53:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 11:53:54,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2022-11-20 11:53:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:54,031 INFO L225 Difference]: With dead ends: 2914 [2022-11-20 11:53:54,031 INFO L226 Difference]: Without dead ends: 1677 [2022-11-20 11:53:54,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-20 11:53:54,036 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 337 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:54,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 405 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:53:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-11-20 11:53:54,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1457. [2022-11-20 11:53:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1153 states have (on average 1.2992194275802256) internal successors, (1498), 1173 states have internal predecessors, (1498), 153 states have call successors, (153), 124 states have call predecessors, (153), 150 states have return successors, (230), 162 states have call predecessors, (230), 151 states have call successors, (230) [2022-11-20 11:53:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1881 transitions. [2022-11-20 11:53:54,179 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1881 transitions. Word has length 64 [2022-11-20 11:53:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:54,180 INFO L495 AbstractCegarLoop]: Abstraction has 1457 states and 1881 transitions. [2022-11-20 11:53:54,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 6 states have internal predecessors, (49), 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-11-20 11:53:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1881 transitions. [2022-11-20 11:53:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-20 11:53:54,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:54,183 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] [2022-11-20 11:53:54,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:53:54,184 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:53:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:54,185 INFO L85 PathProgramCache]: Analyzing trace with hash -91642983, now seen corresponding path program 1 times [2022-11-20 11:53:54,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:54,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889268230] [2022-11-20 11:53:54,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:54,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:54,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:53:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:54,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:53:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:54,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:53:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:54,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:53:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:53:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:54,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:53:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:54,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:53:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:54,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:54,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889268230] [2022-11-20 11:53:54,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889268230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:53:54,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:53:54,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:53:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925494726] [2022-11-20 11:53:54,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:53:54,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:53:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:54,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:53:54,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:53:54,335 INFO L87 Difference]: Start difference. First operand 1457 states and 1881 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 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-11-20 11:53:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:55,211 INFO L93 Difference]: Finished difference Result 4532 states and 5857 transitions. [2022-11-20 11:53:55,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 11:53:55,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 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 64 [2022-11-20 11:53:55,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:55,232 INFO L225 Difference]: With dead ends: 4532 [2022-11-20 11:53:55,232 INFO L226 Difference]: Without dead ends: 3100 [2022-11-20 11:53:55,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:53:55,240 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 301 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:55,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 336 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:53:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2022-11-20 11:53:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2828. [2022-11-20 11:53:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2219 states have (on average 1.2672374943668319) internal successors, (2812), 2260 states have internal predecessors, (2812), 305 states have call successors, (305), 247 states have call predecessors, (305), 303 states have return successors, (502), 326 states have call predecessors, (502), 303 states have call successors, (502) [2022-11-20 11:53:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3619 transitions. [2022-11-20 11:53:55,542 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3619 transitions. Word has length 64 [2022-11-20 11:53:55,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:55,543 INFO L495 AbstractCegarLoop]: Abstraction has 2828 states and 3619 transitions. [2022-11-20 11:53:55,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 4 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-11-20 11:53:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3619 transitions. [2022-11-20 11:53:55,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 11:53:55,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:55,549 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-11-20 11:53:55,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:53:55,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:53:55,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2137648849, now seen corresponding path program 1 times [2022-11-20 11:53:55,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:55,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211837992] [2022-11-20 11:53:55,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:55,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:53:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:55,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:53:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:55,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:53:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:55,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:53:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:55,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:53:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:55,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:53:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:55,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:53:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:55,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:55,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211837992] [2022-11-20 11:53:55,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211837992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:53:55,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:53:55,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:53:55,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806542714] [2022-11-20 11:53:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:53:55,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:53:55,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:55,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:53:55,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:53:55,651 INFO L87 Difference]: Start difference. First operand 2828 states and 3619 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 11:53:56,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:56,415 INFO L93 Difference]: Finished difference Result 7846 states and 10129 transitions. [2022-11-20 11:53:56,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:53:56,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-20 11:53:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:56,455 INFO L225 Difference]: With dead ends: 7846 [2022-11-20 11:53:56,455 INFO L226 Difference]: Without dead ends: 5022 [2022-11-20 11:53:56,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:53:56,464 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 388 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:56,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 246 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:53:56,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5022 states. [2022-11-20 11:53:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5022 to 4506. [2022-11-20 11:53:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4506 states, 3504 states have (on average 1.259703196347032) internal successors, (4414), 3552 states have internal predecessors, (4414), 499 states have call successors, (499), 421 states have call predecessors, (499), 502 states have return successors, (823), 538 states have call predecessors, (823), 497 states have call successors, (823) [2022-11-20 11:53:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 5736 transitions. [2022-11-20 11:53:56,944 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 5736 transitions. Word has length 65 [2022-11-20 11:53:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:56,944 INFO L495 AbstractCegarLoop]: Abstraction has 4506 states and 5736 transitions. [2022-11-20 11:53:56,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 11:53:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 5736 transitions. [2022-11-20 11:53:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-20 11:53:56,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:56,947 INFO L195 NwaCegarLoop]: trace histogram [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-11-20 11:53:56,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:53:56,948 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:53:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -78334537, now seen corresponding path program 1 times [2022-11-20 11:53:56,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:56,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685849676] [2022-11-20 11:53:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:53:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:53:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:57,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:53:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:57,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:53:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:57,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:53:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:57,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:53:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:57,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:53:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:57,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:57,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685849676] [2022-11-20 11:53:57,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685849676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:53:57,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:53:57,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:53:57,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309658730] [2022-11-20 11:53:57,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:53:57,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:53:57,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:57,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:53:57,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:53:57,043 INFO L87 Difference]: Start difference. First operand 4506 states and 5736 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 11:53:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:53:57,972 INFO L93 Difference]: Finished difference Result 6136 states and 7738 transitions. [2022-11-20 11:53:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:53:57,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 72 [2022-11-20 11:53:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:53:58,005 INFO L225 Difference]: With dead ends: 6136 [2022-11-20 11:53:58,005 INFO L226 Difference]: Without dead ends: 6133 [2022-11-20 11:53:58,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:53:58,010 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 559 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:53:58,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 236 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 11:53:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2022-11-20 11:53:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 5560. [2022-11-20 11:53:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5560 states, 4307 states have (on average 1.2500580450429533) internal successors, (5384), 4364 states have internal predecessors, (5384), 625 states have call successors, (625), 535 states have call predecessors, (625), 627 states have return successors, (1016), 666 states have call predecessors, (1016), 624 states have call successors, (1016) [2022-11-20 11:53:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 7025 transitions. [2022-11-20 11:53:58,745 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 7025 transitions. Word has length 72 [2022-11-20 11:53:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:53:58,745 INFO L495 AbstractCegarLoop]: Abstraction has 5560 states and 7025 transitions. [2022-11-20 11:53:58,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 11:53:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 7025 transitions. [2022-11-20 11:53:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 11:53:58,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:53:58,750 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 11:53:58,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:53:58,750 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:53:58,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:53:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1866244794, now seen corresponding path program 1 times [2022-11-20 11:53:58,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:53:58,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225413211] [2022-11-20 11:53:58,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:58,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:53:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:58,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:53:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:58,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:53:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:58,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:53:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:58,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:53:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:58,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:53:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:58,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:53:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:53:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:58,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:53:58,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225413211] [2022-11-20 11:53:58,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225413211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:53:58,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634835176] [2022-11-20 11:53:58,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:53:58,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:53:58,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:53:58,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:53:59,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 11:53:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:53:59,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 11:53:59,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:53:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:59,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:53:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:53:59,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634835176] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:53:59,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:53:59,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-11-20 11:53:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186627417] [2022-11-20 11:53:59,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:53:59,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 11:53:59,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:53:59,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 11:53:59,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:53:59,981 INFO L87 Difference]: Start difference. First operand 5560 states and 7025 transitions. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-20 11:54:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:03,084 INFO L93 Difference]: Finished difference Result 13206 states and 16553 transitions. [2022-11-20 11:54:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 11:54:03,085 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 73 [2022-11-20 11:54:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:03,155 INFO L225 Difference]: With dead ends: 13206 [2022-11-20 11:54:03,155 INFO L226 Difference]: Without dead ends: 13203 [2022-11-20 11:54:03,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 172 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-11-20 11:54:03,164 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 1042 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:03,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 690 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 11:54:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13203 states. [2022-11-20 11:54:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13203 to 10818. [2022-11-20 11:54:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10818 states, 8399 states have (on average 1.249315394689844) internal successors, (10493), 8508 states have internal predecessors, (10493), 1191 states have call successors, (1191), 1025 states have call predecessors, (1191), 1227 states have return successors, (1955), 1290 states have call predecessors, (1955), 1190 states have call successors, (1955) [2022-11-20 11:54:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10818 states to 10818 states and 13639 transitions. [2022-11-20 11:54:04,910 INFO L78 Accepts]: Start accepts. Automaton has 10818 states and 13639 transitions. Word has length 73 [2022-11-20 11:54:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:04,911 INFO L495 AbstractCegarLoop]: Abstraction has 10818 states and 13639 transitions. [2022-11-20 11:54:04,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 7 states have internal predecessors, (119), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-20 11:54:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 10818 states and 13639 transitions. [2022-11-20 11:54:04,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-20 11:54:04,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:04,915 INFO L195 NwaCegarLoop]: trace histogram [3, 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-11-20 11:54:04,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 11:54:05,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 11:54:05,123 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:54:05,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1600677641, now seen corresponding path program 2 times [2022-11-20 11:54:05,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:05,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029818767] [2022-11-20 11:54:05,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:05,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:05,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:54:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:05,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:54:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:05,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:54:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:05,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:05,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:05,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:54:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:05,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:54:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 11:54:05,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:05,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029818767] [2022-11-20 11:54:05,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029818767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:54:05,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:54:05,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:54:05,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592425788] [2022-11-20 11:54:05,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:54:05,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:54:05,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:05,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:54:05,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:54:05,211 INFO L87 Difference]: Start difference. First operand 10818 states and 13639 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 11:54:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:06,525 INFO L93 Difference]: Finished difference Result 17361 states and 21981 transitions. [2022-11-20 11:54:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:54:06,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 76 [2022-11-20 11:54:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:06,563 INFO L225 Difference]: With dead ends: 17361 [2022-11-20 11:54:06,563 INFO L226 Difference]: Without dead ends: 7423 [2022-11-20 11:54:06,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:54:06,592 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 211 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:06,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 375 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:54:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7423 states. [2022-11-20 11:54:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7423 to 6871. [2022-11-20 11:54:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6871 states, 5346 states have (on average 1.222035166479611) internal successors, (6533), 5411 states have internal predecessors, (6533), 758 states have call successors, (758), 649 states have call predecessors, (758), 766 states have return successors, (1174), 816 states have call predecessors, (1174), 757 states have call successors, (1174) [2022-11-20 11:54:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6871 states to 6871 states and 8465 transitions. [2022-11-20 11:54:07,600 INFO L78 Accepts]: Start accepts. Automaton has 6871 states and 8465 transitions. Word has length 76 [2022-11-20 11:54:07,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:07,601 INFO L495 AbstractCegarLoop]: Abstraction has 6871 states and 8465 transitions. [2022-11-20 11:54:07,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 11:54:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 6871 states and 8465 transitions. [2022-11-20 11:54:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 11:54:07,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:07,605 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:54:07,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:54:07,606 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:54:07,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:07,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1691663828, now seen corresponding path program 1 times [2022-11-20 11:54:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:07,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204183556] [2022-11-20 11:54:07,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:07,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:07,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:54:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:07,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:54:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:07,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:54:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:07,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:07,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:07,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:54:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:07,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:54:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 11:54:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 11:54:07,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:07,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204183556] [2022-11-20 11:54:07,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204183556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:54:07,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:54:07,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:54:07,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550273808] [2022-11-20 11:54:07,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:54:07,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:54:07,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:07,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:54:07,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:54:07,759 INFO L87 Difference]: Start difference. First operand 6871 states and 8465 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-20 11:54:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:10,120 INFO L93 Difference]: Finished difference Result 20729 states and 25646 transitions. [2022-11-20 11:54:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 11:54:10,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2022-11-20 11:54:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:10,201 INFO L225 Difference]: With dead ends: 20729 [2022-11-20 11:54:10,202 INFO L226 Difference]: Without dead ends: 13886 [2022-11-20 11:54:10,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-11-20 11:54:10,228 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 725 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:10,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 387 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 11:54:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13886 states. [2022-11-20 11:54:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13886 to 13027. [2022-11-20 11:54:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13027 states, 10018 states have (on average 1.19944100618886) internal successors, (12016), 10185 states have internal predecessors, (12016), 1462 states have call successors, (1462), 1253 states have call predecessors, (1462), 1546 states have return successors, (2563), 1594 states have call predecessors, (2563), 1461 states have call successors, (2563) [2022-11-20 11:54:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13027 states to 13027 states and 16041 transitions. [2022-11-20 11:54:11,840 INFO L78 Accepts]: Start accepts. Automaton has 13027 states and 16041 transitions. Word has length 83 [2022-11-20 11:54:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:11,841 INFO L495 AbstractCegarLoop]: Abstraction has 13027 states and 16041 transitions. [2022-11-20 11:54:11,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-20 11:54:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 13027 states and 16041 transitions. [2022-11-20 11:54:11,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-20 11:54:11,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:11,860 INFO L195 NwaCegarLoop]: trace histogram [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-11-20 11:54:11,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:54:11,861 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:54:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1092647019, now seen corresponding path program 1 times [2022-11-20 11:54:11,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:11,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11486359] [2022-11-20 11:54:11,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:11,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:12,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:54:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:12,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:54:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:12,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:54:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:12,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:12,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:12,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:54:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:12,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:54:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:12,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-20 11:54:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 11:54:12,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:12,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11486359] [2022-11-20 11:54:12,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11486359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:54:12,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:54:12,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 11:54:12,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76592609] [2022-11-20 11:54:12,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:54:12,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 11:54:12,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:12,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 11:54:12,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:54:12,143 INFO L87 Difference]: Start difference. First operand 13027 states and 16041 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 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-11-20 11:54:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:14,005 INFO L93 Difference]: Finished difference Result 23901 states and 29354 transitions. [2022-11-20 11:54:14,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 11:54:14,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 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-11-20 11:54:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:14,055 INFO L225 Difference]: With dead ends: 23901 [2022-11-20 11:54:14,055 INFO L226 Difference]: Without dead ends: 11510 [2022-11-20 11:54:14,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-11-20 11:54:14,090 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 1053 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:14,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 442 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 11:54:14,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11510 states. [2022-11-20 11:54:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11510 to 10610. [2022-11-20 11:54:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10610 states, 8186 states have (on average 1.1887368678231127) internal successors, (9731), 8322 states have internal predecessors, (9731), 1169 states have call successors, (1169), 1002 states have call predecessors, (1169), 1254 states have return successors, (1902), 1291 states have call predecessors, (1902), 1168 states have call successors, (1902) [2022-11-20 11:54:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10610 states to 10610 states and 12802 transitions. [2022-11-20 11:54:15,080 INFO L78 Accepts]: Start accepts. Automaton has 10610 states and 12802 transitions. Word has length 92 [2022-11-20 11:54:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:15,081 INFO L495 AbstractCegarLoop]: Abstraction has 10610 states and 12802 transitions. [2022-11-20 11:54:15,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 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-11-20 11:54:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 10610 states and 12802 transitions. [2022-11-20 11:54:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-20 11:54:15,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:15,098 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 11:54:15,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:54:15,099 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:54:15,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash 578230399, now seen corresponding path program 1 times [2022-11-20 11:54:15,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:15,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715199792] [2022-11-20 11:54:15,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:54:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:54:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:54:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:54:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:54:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 11:54:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 11:54:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 11:54:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:54:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 11:54:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 11:54:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 11:54:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-20 11:54:15,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:15,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715199792] [2022-11-20 11:54:15,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715199792] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:54:15,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028954101] [2022-11-20 11:54:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:15,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:54:15,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:54:15,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:54:15,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 11:54:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:15,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 11:54:15,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:54:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 11:54:15,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:54:15,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028954101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:54:15,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:54:15,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-11-20 11:54:15,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033729272] [2022-11-20 11:54:15,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:54:15,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:54:15,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:15,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:54:15,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-20 11:54:15,546 INFO L87 Difference]: Start difference. First operand 10610 states and 12802 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-20 11:54:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:16,195 INFO L93 Difference]: Finished difference Result 15682 states and 18945 transitions. [2022-11-20 11:54:16,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:54:16,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2022-11-20 11:54:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:16,216 INFO L225 Difference]: With dead ends: 15682 [2022-11-20 11:54:16,217 INFO L226 Difference]: Without dead ends: 5100 [2022-11-20 11:54:16,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:54:16,244 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 34 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:16,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 605 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:54:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2022-11-20 11:54:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 4667. [2022-11-20 11:54:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4667 states, 3699 states have (on average 1.1732900783995674) internal successors, (4340), 3735 states have internal predecessors, (4340), 467 states have call successors, (467), 386 states have call predecessors, (467), 500 states have return successors, (738), 545 states have call predecessors, (738), 466 states have call successors, (738) [2022-11-20 11:54:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 5545 transitions. [2022-11-20 11:54:17,085 INFO L78 Accepts]: Start accepts. Automaton has 4667 states and 5545 transitions. Word has length 144 [2022-11-20 11:54:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:17,086 INFO L495 AbstractCegarLoop]: Abstraction has 4667 states and 5545 transitions. [2022-11-20 11:54:17,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-20 11:54:17,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4667 states and 5545 transitions. [2022-11-20 11:54:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-20 11:54:17,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:17,102 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:54:17,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 11:54:17,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 11:54:17,309 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:54:17,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:17,310 INFO L85 PathProgramCache]: Analyzing trace with hash -371595989, now seen corresponding path program 1 times [2022-11-20 11:54:17,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:17,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237432369] [2022-11-20 11:54:17,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:17,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:54:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:54:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:54:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:54:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:54:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 11:54:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 11:54:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 11:54:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 11:54:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:54:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 11:54:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 11:54:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-20 11:54:17,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:17,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237432369] [2022-11-20 11:54:17,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237432369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:54:17,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:54:17,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:54:17,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327231599] [2022-11-20 11:54:17,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:54:17,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:54:17,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:17,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:54:17,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:54:17,452 INFO L87 Difference]: Start difference. First operand 4667 states and 5545 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-20 11:54:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:18,413 INFO L93 Difference]: Finished difference Result 5210 states and 6157 transitions. [2022-11-20 11:54:18,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:54:18,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 146 [2022-11-20 11:54:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:18,434 INFO L225 Difference]: With dead ends: 5210 [2022-11-20 11:54:18,435 INFO L226 Difference]: Without dead ends: 4461 [2022-11-20 11:54:18,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-20 11:54:18,441 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 219 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:18,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 210 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:54:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4461 states. [2022-11-20 11:54:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4461 to 4242. [2022-11-20 11:54:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4242 states, 3370 states have (on average 1.175074183976261) internal successors, (3960), 3403 states have internal predecessors, (3960), 421 states have call successors, (421), 346 states have call predecessors, (421), 450 states have return successors, (674), 492 states have call predecessors, (674), 420 states have call successors, (674) [2022-11-20 11:54:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4242 states to 4242 states and 5055 transitions. [2022-11-20 11:54:19,188 INFO L78 Accepts]: Start accepts. Automaton has 4242 states and 5055 transitions. Word has length 146 [2022-11-20 11:54:19,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:19,189 INFO L495 AbstractCegarLoop]: Abstraction has 4242 states and 5055 transitions. [2022-11-20 11:54:19,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-20 11:54:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4242 states and 5055 transitions. [2022-11-20 11:54:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-20 11:54:19,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:19,203 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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] [2022-11-20 11:54:19,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 11:54:19,204 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:54:19,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash 83168210, now seen corresponding path program 1 times [2022-11-20 11:54:19,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:19,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633241445] [2022-11-20 11:54:19,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:19,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:54:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:54:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 11:54:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 11:54:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 11:54:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 11:54:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 11:54:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 11:54:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 11:54:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 11:54:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 11:54:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-20 11:54:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-20 11:54:19,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:19,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633241445] [2022-11-20 11:54:19,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633241445] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:54:19,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408836586] [2022-11-20 11:54:19,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:19,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:54:19,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:54:19,417 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:54:19,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 11:54:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:19,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 11:54:19,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:54:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-20 11:54:19,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:54:19,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408836586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:54:19,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:54:19,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 11:54:19,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178515480] [2022-11-20 11:54:19,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:54:19,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:54:19,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:19,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:54:19,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:54:19,808 INFO L87 Difference]: Start difference. First operand 4242 states and 5055 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 11:54:20,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:20,290 INFO L93 Difference]: Finished difference Result 6078 states and 7215 transitions. [2022-11-20 11:54:20,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:54:20,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2022-11-20 11:54:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:20,303 INFO L225 Difference]: With dead ends: 6078 [2022-11-20 11:54:20,303 INFO L226 Difference]: Without dead ends: 2113 [2022-11-20 11:54:20,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:54:20,311 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 36 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 237 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-11-20 11:54:20,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 11:54:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2022-11-20 11:54:20,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2113. [2022-11-20 11:54:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1690 states have (on average 1.16094674556213) internal successors, (1962), 1707 states have internal predecessors, (1962), 202 states have call successors, (202), 168 states have call predecessors, (202), 220 states have return successors, (303), 237 states have call predecessors, (303), 201 states have call successors, (303) [2022-11-20 11:54:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2467 transitions. [2022-11-20 11:54:20,605 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2467 transitions. Word has length 157 [2022-11-20 11:54:20,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:20,606 INFO L495 AbstractCegarLoop]: Abstraction has 2113 states and 2467 transitions. [2022-11-20 11:54:20,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 11:54:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2467 transitions. [2022-11-20 11:54:20,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-20 11:54:20,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:20,613 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:54:20,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 11:54:20,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 11:54:20,820 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:54:20,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:20,821 INFO L85 PathProgramCache]: Analyzing trace with hash 702759848, now seen corresponding path program 1 times [2022-11-20 11:54:20,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:20,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119017919] [2022-11-20 11:54:20,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:20,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:54:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:54:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:54:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:54:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:54:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:54:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 11:54:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 11:54:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 11:54:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-20 11:54:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-20 11:54:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 11:54:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-20 11:54:20,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:20,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119017919] [2022-11-20 11:54:20,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119017919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:54:20,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:54:20,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:54:21,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544465132] [2022-11-20 11:54:21,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:54:21,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:54:21,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:21,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:54:21,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:54:21,002 INFO L87 Difference]: Start difference. First operand 2113 states and 2467 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-20 11:54:21,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:21,628 INFO L93 Difference]: Finished difference Result 3977 states and 4677 transitions. [2022-11-20 11:54:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:54:21,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 158 [2022-11-20 11:54:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:21,635 INFO L225 Difference]: With dead ends: 3977 [2022-11-20 11:54:21,636 INFO L226 Difference]: Without dead ends: 2216 [2022-11-20 11:54:21,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:54:21,640 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 190 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:21,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 356 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 11:54:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2022-11-20 11:54:21,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1672. [2022-11-20 11:54:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1341 states have (on average 1.1670395227442207) internal successors, (1565), 1357 states have internal predecessors, (1565), 158 states have call successors, (158), 132 states have call predecessors, (158), 172 states have return successors, (235), 182 states have call predecessors, (235), 157 states have call successors, (235) [2022-11-20 11:54:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1958 transitions. [2022-11-20 11:54:21,901 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1958 transitions. Word has length 158 [2022-11-20 11:54:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:21,902 INFO L495 AbstractCegarLoop]: Abstraction has 1672 states and 1958 transitions. [2022-11-20 11:54:21,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 4 states have internal predecessors, (93), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-20 11:54:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1958 transitions. [2022-11-20 11:54:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-20 11:54:21,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:21,908 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:54:21,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 11:54:21,909 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:54:21,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:21,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1973905068, now seen corresponding path program 1 times [2022-11-20 11:54:21,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:21,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669318547] [2022-11-20 11:54:21,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:21,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:54:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:54:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:54:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:54:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:54:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:54:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 11:54:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-20 11:54:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 11:54:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-20 11:54:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-20 11:54:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-20 11:54:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-20 11:54:22,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:22,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669318547] [2022-11-20 11:54:22,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669318547] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:54:22,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766868210] [2022-11-20 11:54:22,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:22,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:54:22,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:54:22,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:54:22,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 11:54:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:22,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 11:54:22,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:54:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 11:54:22,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:54:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-20 11:54:23,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766868210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:54:23,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:54:23,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-11-20 11:54:23,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167344454] [2022-11-20 11:54:23,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:54:23,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 11:54:23,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:23,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 11:54:23,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-11-20 11:54:23,166 INFO L87 Difference]: Start difference. First operand 1672 states and 1958 transitions. Second operand has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-11-20 11:54:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:24,596 INFO L93 Difference]: Finished difference Result 3707 states and 4436 transitions. [2022-11-20 11:54:24,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 11:54:24,597 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 161 [2022-11-20 11:54:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:24,605 INFO L225 Difference]: With dead ends: 3707 [2022-11-20 11:54:24,605 INFO L226 Difference]: Without dead ends: 1959 [2022-11-20 11:54:24,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 351 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2022-11-20 11:54:24,610 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 1038 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:24,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 336 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 11:54:24,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2022-11-20 11:54:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1759. [2022-11-20 11:54:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1386 states have (on average 1.1392496392496392) internal successors, (1579), 1407 states have internal predecessors, (1579), 180 states have call successors, (180), 156 states have call predecessors, (180), 192 states have return successors, (286), 195 states have call predecessors, (286), 179 states have call successors, (286) [2022-11-20 11:54:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2045 transitions. [2022-11-20 11:54:24,878 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2045 transitions. Word has length 161 [2022-11-20 11:54:24,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:24,878 INFO L495 AbstractCegarLoop]: Abstraction has 1759 states and 2045 transitions. [2022-11-20 11:54:24,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.5) internal successors, (245), 12 states have internal predecessors, (245), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-11-20 11:54:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2045 transitions. [2022-11-20 11:54:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-20 11:54:24,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:24,885 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 11:54:24,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 11:54:25,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:54:25,092 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:54:25,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:25,092 INFO L85 PathProgramCache]: Analyzing trace with hash 11419214, now seen corresponding path program 1 times [2022-11-20 11:54:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:25,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86520343] [2022-11-20 11:54:25,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:25,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:54:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-20 11:54:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 11:54:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 11:54:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 11:54:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 11:54:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 11:54:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 11:54:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 11:54:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 11:54:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 11:54:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 11:54:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-20 11:54:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-20 11:54:25,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:25,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86520343] [2022-11-20 11:54:25,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86520343] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:54:25,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704522931] [2022-11-20 11:54:25,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:25,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:54:25,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:54:25,280 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:54:25,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 11:54:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:25,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 11:54:25,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:54:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-20 11:54:25,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 11:54:25,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704522931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:54:25,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 11:54:25,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-20 11:54:25,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774481842] [2022-11-20 11:54:25,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:54:25,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:54:25,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:25,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:54:25,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:54:25,504 INFO L87 Difference]: Start difference. First operand 1759 states and 2045 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-20 11:54:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:25,875 INFO L93 Difference]: Finished difference Result 3404 states and 3968 transitions. [2022-11-20 11:54:25,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:54:25,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 178 [2022-11-20 11:54:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:25,880 INFO L225 Difference]: With dead ends: 3404 [2022-11-20 11:54:25,880 INFO L226 Difference]: Without dead ends: 1476 [2022-11-20 11:54:25,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:54:25,883 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 151 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:25,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 225 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 11:54:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2022-11-20 11:54:26,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1439. [2022-11-20 11:54:26,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1142 states have (on average 1.1287215411558669) internal successors, (1289), 1154 states have internal predecessors, (1289), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2022-11-20 11:54:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1648 transitions. [2022-11-20 11:54:26,018 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1648 transitions. Word has length 178 [2022-11-20 11:54:26,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:26,018 INFO L495 AbstractCegarLoop]: Abstraction has 1439 states and 1648 transitions. [2022-11-20 11:54:26,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-20 11:54:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1648 transitions. [2022-11-20 11:54:26,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-11-20 11:54:26,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:26,024 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:54:26,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 11:54:26,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:54:26,230 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:54:26,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:26,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1242735248, now seen corresponding path program 1 times [2022-11-20 11:54:26,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:26,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815427757] [2022-11-20 11:54:26,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:26,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 11:54:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 11:54:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:54:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-20 11:54:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:54:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 11:54:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 11:54:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-20 11:54:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 11:54:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 11:54:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-20 11:54:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-20 11:54:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-20 11:54:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-20 11:54:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-11-20 11:54:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-20 11:54:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 11:54:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-20 11:54:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-20 11:54:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-11-20 11:54:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-11-20 11:54:26,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:26,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815427757] [2022-11-20 11:54:26,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815427757] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 11:54:26,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675907200] [2022-11-20 11:54:26,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:26,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:54:26,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:54:26,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 11:54:26,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 11:54:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:26,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 11:54:26,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 11:54:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-20 11:54:26,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 11:54:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-11-20 11:54:27,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675907200] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 11:54:27,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 11:54:27,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-11-20 11:54:27,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865498637] [2022-11-20 11:54:27,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 11:54:27,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 11:54:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 11:54:27,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:54:27,120 INFO L87 Difference]: Start difference. First operand 1439 states and 1648 transitions. Second operand has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-11-20 11:54:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:54:27,948 INFO L93 Difference]: Finished difference Result 1742 states and 1983 transitions. [2022-11-20 11:54:27,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 11:54:27,949 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 252 [2022-11-20 11:54:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:54:27,950 INFO L225 Difference]: With dead ends: 1742 [2022-11-20 11:54:27,950 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 11:54:27,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 547 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2022-11-20 11:54:27,954 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 279 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:54:27,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 353 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:54:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 11:54:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 11:54:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:54:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 11:54:27,956 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2022-11-20 11:54:27,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:54:27,956 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 11:54:27,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 8 states have internal predecessors, (227), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-11-20 11:54:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 11:54:27,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 11:54:27,960 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 11:54:27,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 11:54:28,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 11:54:28,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 11:55:03,712 INFO L899 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2022-11-20 11:55:03,713 INFO L899 garLoopResultBuilder]: For program point L323-2(lines 307 331) no Hoare annotation was computed. [2022-11-20 11:55:03,713 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2022-11-20 11:55:03,714 INFO L895 garLoopResultBuilder]: At program point L313(line 313) the Hoare annotation is: (let ((.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse13 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (= ~p_num_write~0 0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse3 (not (= ~q_free~0 0))) (.cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~q_read_ev~0 2))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse21)) (.cse16 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse18 (not (<= 2 ~q_write_ev~0))) (.cse19 (not (<= 1 ~c_dr_pc~0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse7 (= |old(~c_dr_st~0)| 0)) (.cse8 (not (<= ~q_req_up~0 0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse1 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse13 .cse14 .cse7 .cse15 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse13 .cse18 .cse19 .cse6 .cse14 .cse7 .cse15 .cse10) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse10) (or .cse20 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse11 .cse2 .cse12 .cse5 (and .cse21 (= ~p_dw_st~0 0)) .cse6 .cse14 (not .cse0) .cse8 .cse9 .cse15 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse18 .cse19 .cse6 .cse14 .cse7 .cse8 .cse15 .cse10)))) [2022-11-20 11:55:03,715 INFO L895 garLoopResultBuilder]: At program point L315-2(lines 315 319) the Hoare annotation is: (let ((.cse2 (= ~p_dw_st~0 0)) (.cse29 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse26 (< 0 (+ activate_threads_~tmp~1 1))) (.cse28 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse27 (<= activate_threads_~tmp~1 0))) (let ((.cse1 (not (= ~c_dr_st~0 0))) (.cse18 (and .cse29 .cse26 .cse28 .cse27)) (.cse4 (and .cse29 .cse28)) (.cse10 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse11 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse12 (not (<= ~c_dr_pc~0 1))) (.cse13 (not (<= 2 ~q_write_ev~0))) (.cse14 (not (<= 1 ~c_dr_pc~0))) (.cse22 (and .cse26 .cse27)) (.cse23 (not (= ~p_num_write~0 0))) (.cse24 (not (= ~c_num_read~0 0))) (.cse19 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse15 (not (= ~q_free~0 1))) (.cse16 (not (<= ~q_req_up~0 0))) (.cse20 (not (= ~q_read_ev~0 2))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse25 (not .cse2)) (.cse3 (= |old(~p_dw_st~0)| 0)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~q_free~0 0))) (.cse21 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse9 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or (and (= ~q_read_ev~0 1) .cse1 .cse2) .cse3 .cse4 .cse10 .cse5 .cse11 .cse12 .cse13 .cse14 .cse7 .cse15 .cse8 .cse16 .cse17 .cse9) (or .cse18 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse12 .cse19 (= ~q_write_ev~0 0) .cse7 .cse8 .cse16 .cse20 .cse9) (or .cse3 .cse10 .cse5 .cse11 .cse12 .cse21 .cse13 .cse14 .cse7 .cse15 .cse8 .cse20 .cse17 .cse22 .cse9) (or .cse3 .cse4 .cse23 .cse5 .cse24 .cse19 .cse21 .cse15 .cse8 .cse17 .cse9) (or .cse18 .cse3 .cse5 .cse6 .cse12 .cse19 .cse13 .cse7 .cse8 .cse16 .cse20 .cse9) (or .cse3 .cse4 .cse10 .cse5 .cse11 .cse12 .cse21 .cse13 .cse14 .cse7 .cse15 .cse8 .cse17 .cse9) (or .cse3 .cse10 .cse5 .cse11 .cse12 .cse13 .cse14 .cse7 .cse15 .cse8 .cse16 .cse20 .cse17 .cse22 .cse9) (or .cse3 .cse23 .cse5 .cse24 .cse19 .cse21 .cse15 .cse8 .cse20 .cse17 .cse22 .cse9) (or (and .cse25 .cse26 .cse27) .cse0 .cse3 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9) (or .cse0 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse23 .cse5 .cse24 (and .cse26 .cse28 .cse2 .cse27) .cse19 .cse7 .cse15 (not .cse3) .cse16 .cse20 .cse17 .cse9) (or .cse0 .cse25 .cse3 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9)))) [2022-11-20 11:55:03,715 INFO L899 garLoopResultBuilder]: For program point L313-1(line 313) no Hoare annotation was computed. [2022-11-20 11:55:03,716 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 307 331) the Hoare annotation is: (let ((.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse13 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (= ~p_num_write~0 0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse3 (not (= ~q_free~0 0))) (.cse5 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~q_read_ev~0 2))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse21)) (.cse16 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse18 (not (<= 2 ~q_write_ev~0))) (.cse19 (not (<= 1 ~c_dr_pc~0))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse7 (= |old(~c_dr_st~0)| 0)) (.cse8 (not (<= ~q_req_up~0 0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse1 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse13 .cse14 .cse7 .cse15 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse13 .cse18 .cse19 .cse6 .cse14 .cse7 .cse15 .cse10) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse10) (or .cse20 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse11 .cse2 .cse12 .cse5 (and .cse21 (= ~p_dw_st~0 0)) .cse6 .cse14 (not .cse0) .cse8 .cse9 .cse15 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse17 .cse4 .cse18 .cse19 .cse6 .cse14 .cse7 .cse8 .cse15 .cse10)))) [2022-11-20 11:55:03,716 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 307 331) no Hoare annotation was computed. [2022-11-20 11:55:03,717 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-11-20 11:55:03,717 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 265) no Hoare annotation was computed. [2022-11-20 11:55:03,717 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 251 270) no Hoare annotation was computed. [2022-11-20 11:55:03,717 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 251 270) the Hoare annotation is: true [2022-11-20 11:55:03,718 INFO L895 garLoopResultBuilder]: At program point L267(lines 254 269) the Hoare annotation is: (let ((.cse9 (= ~q_read_ev~0 2)) (.cse11 (= ~c_dr_st~0 0)) (.cse5 (= ~p_dw_st~0 0))) (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse12 (not .cse5)) (.cse20 (not (= ~p_num_write~0 0))) (.cse3 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~q_free~0 1))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse8 (not .cse11)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= ~q_free~0 0))) (.cse13 (not (<= ~c_dr_pc~0 1))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse6 (not (<= 2 ~q_write_ev~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse17 (not (<= ~q_req_up~0 0))) (.cse18 (not .cse9)) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not (= ~q_req_up~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 1 ~p_num_write~0)) (not (<= 1 ~q_read_ev~0)) (and .cse8 .cse9) (not (<= ~p_num_write~0 1)) .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse2 .cse4 .cse7 .cse10) (or .cse0 .cse11 .cse12 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse2 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse13 .cse14 .cse6 .cse15 .cse7 .cse16 .cse17 .cse18 .cse19 .cse10) (or .cse0 .cse1 .cse12 .cse20 .cse2 .cse3 .cse14 .cse6 .cse7 .cse16 .cse17 .cse18 .cse19 .cse10) (or .cse0 .cse11 .cse1 .cse12 .cse20 .cse2 .cse3 .cse14 .cse7 .cse16 .cse19 .cse10) (or .cse0 .cse11 .cse12 .cse20 .cse2 .cse3 .cse13 .cse6 .cse15 .cse7 .cse16 .cse17 .cse18 .cse19 .cse10) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse8 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse4 .cse13 .cse5 .cse14 .cse6 .cse15 .cse7 .cse17 .cse18 .cse10)))) [2022-11-20 11:55:03,718 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 264) no Hoare annotation was computed. [2022-11-20 11:55:03,719 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 251 270) no Hoare annotation was computed. [2022-11-20 11:55:03,719 INFO L895 garLoopResultBuilder]: At program point L95(lines 83 97) the Hoare annotation is: (let ((.cse26 (<= 1 ~c_dr_pc~0)) (.cse27 (<= ~c_dr_pc~0 1)) (.cse22 (= 1 ~c_dr_i~0)) (.cse23 (<= is_do_read_c_triggered_~__retres1~1 0)) (.cse25 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse24 (<= 0 is_do_read_c_triggered_~__retres1~1))) (let ((.cse5 (and .cse26 .cse27 .cse22 .cse23 .cse25 .cse24)) (.cse14 (not (= ~q_free~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not .cse27)) (.cse21 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse8 (not .cse26)) (.cse18 (not (<= ~c_dr_pc~0 0))) (.cse15 (= ~p_dw_st~0 0)) (.cse19 (not (= ~p_num_write~0 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse20 (not (= ~c_num_read~0 0))) (.cse6 (not .cse25)) (.cse16 (and .cse23 .cse24)) (.cse9 (not (= ~p_dw_i~0 1))) (.cse10 (not (= ~q_free~0 1))) (.cse11 (not (<= ~q_req_up~0 0))) (.cse17 (not (= ~q_read_ev~0 2))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not .cse22))) (and (or .cse0 (not (= ~q_read_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (< 0 ~q_write_ev~0) (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse14 .cse4 .cse15 .cse6 (= ~q_write_ev~0 0) .cse16 .cse9 .cse11 .cse17 .cse13) (or .cse0 .cse2 .cse14 .cse4 .cse15 .cse6 .cse16 .cse7 .cse9 .cse11 .cse17 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse18 .cse2 .cse14 .cse16 .cse9 .cse13) (or .cse0 .cse19 .cse2 .cse20 .cse15 .cse6 .cse21 .cse16 .cse10 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse21 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse18 (not .cse15) (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse19 .cse2 .cse20 .cse6 .cse16 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13)))) [2022-11-20 11:55:03,720 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 80 98) the Hoare annotation is: true [2022-11-20 11:55:03,720 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-11-20 11:55:03,720 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2022-11-20 11:55:03,720 INFO L899 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2022-11-20 11:55:03,720 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 80 98) no Hoare annotation was computed. [2022-11-20 11:55:03,721 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 80 98) no Hoare annotation was computed. [2022-11-20 11:55:03,721 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 271 288) the Hoare annotation is: (let ((.cse22 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse7 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse18 (not (= ~q_free~0 0))) (.cse17 (not (<= ~c_dr_pc~0 0))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse21 (and .cse22 (= ~q_read_ev~0 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (and .cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse5 (not (<= ~c_dr_pc~0 1))) (.cse6 (= ~p_dw_st~0 0)) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse11 (not (= ~q_free~0 1))) (.cse20 (not (<= ~q_req_up~0 0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse4 .cse15 .cse6 .cse16 .cse7 .cse11 .cse12 .cse13) (or .cse0 .cse17 .cse2 .cse4 .cse18 .cse6 .cse10 .cse13) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse4 .cse18 .cse5 .cse6 .cse16 .cse19 .cse10 .cse20 .cse13) (or .cse0 .cse2 .cse18 .cse5 .cse6 .cse16 .cse8 .cse19 .cse10 .cse20 .cse21 .cse13) (or .cse17 (not .cse6) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse14 .cse2 .cse15 .cse16 .cse19 .cse10 .cse11 .cse20 .cse12 .cse21 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13)))) [2022-11-20 11:55:03,721 INFO L899 garLoopResultBuilder]: For program point L280-1(lines 271 288) no Hoare annotation was computed. [2022-11-20 11:55:03,722 INFO L899 garLoopResultBuilder]: For program point L275-1(lines 274 287) no Hoare annotation was computed. [2022-11-20 11:55:03,722 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 271 288) no Hoare annotation was computed. [2022-11-20 11:55:03,722 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 34 49) no Hoare annotation was computed. [2022-11-20 11:55:03,722 INFO L899 garLoopResultBuilder]: For program point L222-1(lines 218 232) no Hoare annotation was computed. [2022-11-20 11:55:03,723 INFO L895 garLoopResultBuilder]: At program point update_channelsENTRY(lines 218 232) the Hoare annotation is: (let ((.cse18 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse9 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse10 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse30 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse11 (= ~q_read_ev~0 2))) (let ((.cse1 (not (= |old(~q_req_up~0)| 1))) (.cse8 (= ~q_req_up~0 1)) (.cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse3 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse26 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse17 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse6 (not (<= ~c_dr_pc~0 1))) (.cse13 (not (<= 2 |old(~q_write_ev~0)|))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse23 (and .cse9 .cse10 .cse30 .cse11)) (.cse27 (not (= ~p_num_write~0 0))) (.cse28 (not (= ~c_num_read~0 0))) (.cse24 (not (<= |old(~q_req_up~0)| 0))) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse21 (not (= ~q_free~0 1))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse29 (not (<= ~c_dr_pc~0 0))) (.cse25 (and .cse9 .cse10 .cse18 .cse30)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~q_free~0 0))) (.cse7 (= ~p_dw_st~0 0)) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 (not (<= 1 |old(~q_read_ev~0)|)) .cse1 .cse17 (and .cse8 .cse9 .cse10 .cse18) .cse4 .cse19 .cse6 .cse7 .cse13 .cse20 .cse15 .cse21 .cse22 .cse16) (or .cse0 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse24 .cse7 .cse12 .cse14 .cse15 (= |old(~q_write_ev~0)| 0) .cse16) (or .cse0 .cse25 .cse17 .cse4 .cse19 .cse6 .cse7 .cse26 .cse13 .cse20 .cse15 .cse21 .cse22 .cse16) (or .cse0 .cse23 .cse4 .cse5 .cse6 .cse24 .cse7 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse25 .cse27 .cse4 .cse28 .cse7 .cse12 .cse26 .cse21 .cse22 .cse16) (or .cse0 .cse25 .cse17 .cse4 .cse19 .cse6 .cse24 .cse7 .cse13 .cse20 .cse15 .cse21 .cse22 .cse16) (or .cse29 (not .cse7) .cse23 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse27 .cse4 .cse28 .cse24 .cse12 .cse14 .cse15 .cse21 .cse22 .cse16) (or .cse0 .cse29 .cse25 .cse4 .cse5 .cse7 .cse15 .cse16)))) [2022-11-20 11:55:03,724 INFO L895 garLoopResultBuilder]: At program point L48(lines 31 50) the Hoare annotation is: (let ((.cse16 (not (= |old(~q_req_up~0)| 1))) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse15 (<= ~q_req_up~0 0)) (.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse17 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse18 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse21 (not (<= ~c_dr_pc~0 0))) (.cse10 (not (= ~q_free~0 1))) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse19 (not (= ~q_free~0 0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse13 (not (<= |old(~q_req_up~0)| 0))) (.cse6 (= ~p_dw_st~0 0)) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse7 (not (<= 2 |old(~q_write_ev~0)|))) (.cse20 (not (= |old(~q_read_ev~0)| 2))) (.cse8 (not (<= 1 ~c_dr_pc~0))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse12 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (and .cse15 (= ~q_read_ev~0 2)) .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse14 .cse7 .cse20 .cse8 .cse9 .cse12) (or .cse0 .cse21 .cse2 .cse19 .cse6 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse9 .cse12) (or .cse0 (not (<= 1 |old(~q_read_ev~0)|)) .cse16 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (and .cse15 .cse5) .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse17 .cse18 .cse2 .cse19 .cse4 .cse13 .cse6 .cse14 .cse20 .cse8 .cse9 (= |old(~q_write_ev~0)| 0) .cse12) (or .cse21 (not .cse6) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (not (= ~p_num_write~0 0)) .cse2 (not (= ~c_num_read~0 0)) .cse13 .cse14 .cse20 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse2 .cse19 .cse4 .cse13 .cse6 .cse14 .cse7 .cse20 .cse8 .cse9 .cse12))) [2022-11-20 11:55:03,724 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 218 232) no Hoare annotation was computed. [2022-11-20 11:55:03,724 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2022-11-20 11:55:03,724 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 39) no Hoare annotation was computed. [2022-11-20 11:55:03,725 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 289 306) no Hoare annotation was computed. [2022-11-20 11:55:03,725 INFO L899 garLoopResultBuilder]: For program point L298-1(lines 289 306) no Hoare annotation was computed. [2022-11-20 11:55:03,725 INFO L899 garLoopResultBuilder]: For program point L293-1(lines 292 305) no Hoare annotation was computed. [2022-11-20 11:55:03,725 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 289 306) the Hoare annotation is: (let ((.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse7 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse14 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse22 (not (<= ~c_dr_pc~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse3 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (and .cse25 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse11 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse23 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse24 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse18 (not (= ~q_free~0 0))) (.cse5 (not (<= ~c_dr_pc~0 1))) (.cse6 (= ~p_dw_st~0 0)) (.cse16 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse20 (not (< 0 |old(~q_write_ev~0)|))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse17 (not (<= ~q_req_up~0 0))) (.cse21 (and .cse25 (= ~q_read_ev~0 2))) (.cse13 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse4 .cse15 .cse6 .cse16 .cse7 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 (not (= |old(~q_read_ev~0)| 1)) .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13) (or .cse0 .cse2 .cse18 .cse5 .cse6 .cse16 .cse19 .cse20 .cse10 .cse17 .cse21 .cse13) (or .cse22 (not .cse6) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse14 .cse2 .cse15 .cse16 .cse19 .cse10 .cse11 .cse17 .cse12 .cse21 .cse13) (or .cse0 .cse22 .cse2 .cse4 .cse18 .cse10 .cse13) (or .cse0 .cse23 .cse24 .cse2 .cse4 .cse18 .cse5 .cse6 .cse16 .cse19 .cse10 (= |old(~q_write_ev~0)| 0) .cse17 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13) (or .cse23 .cse24 .cse2 .cse18 .cse5 .cse6 .cse16 .cse19 .cse20 .cse9 .cse10 .cse17 .cse21 .cse13)))) [2022-11-20 11:55:03,726 INFO L895 garLoopResultBuilder]: At program point L415(line 415) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2022-11-20 11:55:03,726 INFO L899 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2022-11-20 11:55:03,726 INFO L895 garLoopResultBuilder]: At program point L242-1(lines 233 250) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2022-11-20 11:55:03,727 INFO L895 garLoopResultBuilder]: At program point L432(line 432) the Hoare annotation is: (let ((.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse2 (= ~q_free~0 1)) (.cse16 (<= 2 ~q_write_ev~0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse17 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (< ~c_num_read~0 ~p_num_write~0)) (.cse15 (<= 1 ~c_dr_pc~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse19 (< 0 ~q_write_ev~0)) (.cse11 (<= ~q_req_up~0 0)) (.cse12 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse8 .cse9 .cse3 .cse4 .cse10 .cse5 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse16 .cse9 .cse3 .cse4 .cse17 .cse13 .cse6 .cse7 .cse18) (and .cse1 .cse3 .cse4 .cse10 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse15 .cse2 .cse16 .cse9 .cse3 .cse4 .cse5 .cse17 .cse11 .cse13 .cse6 .cse18) (and .cse0 .cse1 .cse9 .cse3 .cse4 .cse10 .cse5 .cse19 .cse11 .cse12 .cse13) (and .cse1 .cse15 .cse2 (= ~q_read_ev~0 1) .cse16 .cse9 .cse3 .cse4 .cse5 .cse17 .cse11 .cse13 .cse6 .cse18) (and .cse0 .cse1 .cse8 .cse15 .cse9 .cse4 .cse10 .cse5 .cse19 .cse11 .cse12 .cse13 .cse14))) [2022-11-20 11:55:03,727 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 11:55:03,727 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 11:55:03,727 INFO L895 garLoopResultBuilder]: At program point L474(lines 465 476) the Hoare annotation is: (= 1 ~c_dr_i~0) [2022-11-20 11:55:03,728 INFO L899 garLoopResultBuilder]: For program point L342(line 342) no Hoare annotation was computed. [2022-11-20 11:55:03,728 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2022-11-20 11:55:03,728 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2022-11-20 11:55:03,729 INFO L895 garLoopResultBuilder]: At program point L392(line 392) the Hoare annotation is: (let ((.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse15 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse15 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse1 .cse3 .cse4 .cse16 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse15 .cse8 .cse9 .cse10 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 .cse12 .cse17 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13))) [2022-11-20 11:55:03,729 INFO L899 garLoopResultBuilder]: For program point L392-1(line 392) no Hoare annotation was computed. [2022-11-20 11:55:03,729 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2022-11-20 11:55:03,729 INFO L895 garLoopResultBuilder]: At program point L442(lines 405 447) the Hoare annotation is: (= 1 ~c_dr_i~0) [2022-11-20 11:55:03,730 INFO L895 garLoopResultBuilder]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse15 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse15 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse1 .cse3 .cse4 .cse16 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse15 .cse8 .cse9 .cse10 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 .cse12 .cse17 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13))) [2022-11-20 11:55:03,730 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2022-11-20 11:55:03,730 INFO L895 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: false [2022-11-20 11:55:03,730 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2022-11-20 11:55:03,731 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2022-11-20 11:55:03,731 INFO L895 garLoopResultBuilder]: At program point L212(lines 165 217) the Hoare annotation is: (let ((.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (<= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse0 (= ~p_dw_st~0 0)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~q_req_up~0 1) (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 ~c_num_read~0) (<= 1 ~q_read_ev~0) .cse9 .cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~q_req_up~0 0) .cse0 (= ~q_read_ev~0 2) .cse9 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))))) [2022-11-20 11:55:03,731 INFO L895 garLoopResultBuilder]: At program point L402(lines 386 404) the Hoare annotation is: (let ((.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse15 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse15 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse1 .cse3 .cse4 .cse16 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse15 .cse8 .cse9 .cse10 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13 .cse18) (and .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse5 .cse11 .cse12 .cse17 .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse16 .cse5 .cse12 .cse17 .cse13))) [2022-11-20 11:55:03,732 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 241) no Hoare annotation was computed. [2022-11-20 11:55:03,732 INFO L899 garLoopResultBuilder]: For program point L237-2(lines 236 249) no Hoare annotation was computed. [2022-11-20 11:55:03,732 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse9 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse8 (= ~q_req_up~0 1)) (.cse16 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (<= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 (<= 1 ~q_read_ev~0) .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse15 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse16 .cse11 .cse3 .cse4 .cse17 .cse5 .cse15 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse13 (<= ~c_dr_pc~0 0)) (and .cse8 .cse0 .cse1 .cse16 .cse10 .cse11 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse10 .cse11 .cse3 .cse4 .cse17 .cse5 .cse15 .cse18 .cse13))) [2022-11-20 11:55:03,733 INFO L899 garLoopResultBuilder]: For program point L427-1(line 427) no Hoare annotation was computed. [2022-11-20 11:55:03,733 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 399) no Hoare annotation was computed. [2022-11-20 11:55:03,733 INFO L895 garLoopResultBuilder]: At program point L419-1(lines 416 441) the Hoare annotation is: (let ((.cse17 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse19 (<= ~c_dr_pc~0 0)) (.cse20 (< ~c_num_read~0 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse10 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (not .cse17)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (<= 2 ~q_write_ev~0)) (.cse12 (<= ~c_dr_pc~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse21 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2)) (.cse15 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse3 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6 .cse13 .cse14 .cse15 .cse8 .cse16) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse14 .cse17 .cse18 .cse15 .cse8 .cse19) (and .cse1 .cse3 (not (= ~q_write_ev~0 0)) .cse20 .cse12 .cse5 .cse6 .cse21 .cse7 .cse14 .cse18 .cse15 .cse22) (and .cse1 .cse3 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6 .cse13 .cse15 .cse8 .cse9 .cse16) (and .cse3 .cse5 .cse6 .cse21 .cse15 .cse19) (and .cse1 .cse3 .cse20 .cse10 .cse11 .cse12 .cse6 .cse21 .cse7 .cse14 .cse18 .cse15 .cse22) (and .cse3 .cse10 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7 .cse13 .cse14 .cse18 .cse15 .cse8 .cse16) (and .cse1 .cse3 .cse11 .cse12 .cse5 .cse6 .cse21 .cse7 .cse14 .cse18 .cse15)))) [2022-11-20 11:55:03,733 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2022-11-20 11:55:03,734 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-11-20 11:55:03,734 INFO L899 garLoopResultBuilder]: For program point L172(lines 172 176) no Hoare annotation was computed. [2022-11-20 11:55:03,734 INFO L895 garLoopResultBuilder]: At program point L139-1(lines 127 162) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse4 (= ~q_free~0 1)) (.cse11 (<= ~q_req_up~0 0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse15 (<= ~c_dr_pc~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= ~q_free~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse12 (<= 1 ~q_read_ev~0)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse6 .cse7 .cse11 .cse12 .cse8 .cse9) (and .cse1 .cse3 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse10 .cse15 .cse5 .cse6 .cse7 .cse11 .cse16 .cse8) (and .cse17 .cse1 .cse3 (< ~c_num_read~0 ~p_num_write~0) .cse14 .cse10 .cse15 .cse5 .cse6 .cse13 .cse7 .cse16 .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse17 .cse1 .cse2 .cse3 .cse10 .cse6 .cse13 .cse7 (<= ~p_num_write~0 1) .cse12 .cse8 .cse9 (<= 1 ~p_num_write~0)))) [2022-11-20 11:55:03,734 INFO L899 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-11-20 11:55:03,735 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2022-11-20 11:55:03,735 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 11:55:03,735 INFO L895 garLoopResultBuilder]: At program point L412(line 412) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2022-11-20 11:55:03,735 INFO L899 garLoopResultBuilder]: For program point L412-1(line 412) no Hoare annotation was computed. [2022-11-20 11:55:03,736 INFO L899 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2022-11-20 11:55:03,736 INFO L895 garLoopResultBuilder]: At program point L462(lines 448 464) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2022-11-20 11:55:03,736 INFO L895 garLoopResultBuilder]: At program point L173(lines 168 216) the Hoare annotation is: (and (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (< ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) (<= 2 ~q_write_ev~0) (<= ~c_dr_pc~0 1) (not (= ~c_dr_st~0 0)) (= 1 ~c_dr_i~0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|) (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-11-20 11:55:03,737 INFO L899 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2022-11-20 11:55:03,737 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2022-11-20 11:55:03,737 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 11:55:03,737 INFO L895 garLoopResultBuilder]: At program point L380(lines 332 385) the Hoare annotation is: (let ((.cse9 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse8 (= ~q_req_up~0 1)) (.cse16 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (<= ~q_req_up~0 0)) (.cse18 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 (<= 1 ~q_read_ev~0) .cse13 .cse6 .cse14) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse15 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse16 .cse11 .cse3 .cse4 .cse17 .cse5 .cse15 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse17 .cse13 (<= ~c_dr_pc~0 0)) (and .cse8 .cse0 .cse1 .cse16 .cse10 .cse11 .cse3 .cse4 .cse17 .cse5 .cse18 .cse13 .cse19) (and .cse0 .cse1 .cse10 .cse11 .cse3 .cse4 .cse17 .cse5 .cse15 .cse18 .cse13))) [2022-11-20 11:55:03,738 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2022-11-20 11:55:03,738 INFO L895 garLoopResultBuilder]: At program point L141(lines 127 162) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse8 (<= ~c_dr_pc~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse7 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse3 .cse9 .cse5 (= ~q_free~0 0) .cse6 .cse7 .cse8) (and .cse1 .cse3 (<= 1 ~c_dr_pc~0) .cse4 (<= ~c_dr_pc~0 1) .cse9 .cse5 .cse6 (<= ~p_num_write~0 ~c_num_read~0) (= ~q_read_ev~0 2) .cse7 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-20 11:55:03,739 INFO L895 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0))) (let ((.cse12 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse0 (= ~p_num_write~0 0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse17 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (= ~c_num_read~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse18 (<= 1 ~q_read_ev~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse13 (= ~q_req_up~0 1)) (.cse23 (< ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse11 (not .cse21)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse24 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse22 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12) (and .cse13 .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse18 .cse8 .cse9 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse20 .cse21 .cse22 .cse8 .cse9 .cse10) (and .cse11 .cse2 (not (= ~q_write_ev~0 0)) .cse23 .cse16 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse17 .cse8 .cse9 .cse12 .cse19) (and .cse2 .cse4 .cse5 .cse24 .cse8 .cse10) (and .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse20 .cse8 .cse9 .cse19) (and .cse11 .cse2 .cse23 .cse14 .cse15 .cse16 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse7 .cse20 .cse22 .cse8 .cse9) (and .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse20 .cse22 .cse8 .cse9 .cse19) (and .cse13 .cse11 .cse1 .cse2 .cse15 .cse5 .cse24 .cse7 (<= ~p_num_write~0 1) .cse18 .cse8 .cse10 (<= 1 ~p_num_write~0)) (and .cse13 .cse11 .cse2 .cse23 .cse15 .cse16 .cse4 .cse5 .cse24 .cse6 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse15 .cse16 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8)))) [2022-11-20 11:55:03,739 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-11-20 11:55:03,739 INFO L895 garLoopResultBuilder]: At program point L414(line 414) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2022-11-20 11:55:03,740 INFO L895 garLoopResultBuilder]: At program point L158(lines 124 163) the Hoare annotation is: (let ((.cse4 (not (= ~c_dr_st~0 0))) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 (<= ~c_dr_pc~0 1) .cse4 .cse5 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse7 (= ~q_read_ev~0 2) .cse8 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse6 .cse7 (<= ~p_num_write~0 1) (<= 1 ~q_read_ev~0) .cse8 .cse9 (<= 1 ~p_num_write~0)))) [2022-11-20 11:55:03,740 INFO L895 garLoopResultBuilder]: At program point L414-1(line 414) the Hoare annotation is: (and (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0)) [2022-11-20 11:55:03,740 INFO L895 garLoopResultBuilder]: At program point L340(line 340) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0))) (let ((.cse12 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse0 (= ~p_num_write~0 0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse3 (= ~q_free~0 1)) (.cse17 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (= ~c_num_read~0 0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse18 (<= 1 ~q_read_ev~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse13 (= ~q_req_up~0 1)) (.cse23 (< ~c_num_read~0 ~p_num_write~0)) (.cse25 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse11 (not .cse21)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse24 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse22 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse12) (and .cse13 .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse18 .cse8 .cse9 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse20 .cse21 .cse22 .cse8 .cse9 .cse10) (and .cse11 .cse2 (not (= ~q_write_ev~0 0)) .cse23 .cse16 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse17 .cse8 .cse9 .cse12 .cse19) (and .cse2 .cse4 .cse5 .cse24 .cse8 .cse10) (and .cse11 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse20 .cse8 .cse9 .cse19) (and .cse11 .cse2 .cse23 .cse14 .cse15 .cse16 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8 .cse25) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse7 .cse20 .cse22 .cse8 .cse9) (and .cse2 .cse14 .cse3 .cse15 .cse16 .cse4 .cse5 .cse6 .cse17 .cse20 .cse22 .cse8 .cse9 .cse19) (and .cse13 .cse11 .cse1 .cse2 .cse15 .cse5 .cse24 .cse7 (<= ~p_num_write~0 1) .cse18 .cse8 .cse10 (<= 1 ~p_num_write~0)) (and .cse13 .cse11 .cse2 .cse23 .cse15 .cse16 .cse4 .cse5 .cse24 .cse6 .cse22 .cse8 .cse25) (and .cse11 .cse2 .cse15 .cse16 .cse4 .cse5 .cse24 .cse6 .cse20 .cse22 .cse8)))) [2022-11-20 11:55:03,741 INFO L895 garLoopResultBuilder]: At program point L208(line 208) the Hoare annotation is: false [2022-11-20 11:55:03,741 INFO L895 garLoopResultBuilder]: At program point L208-1(lines 168 216) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 0))) (let ((.cse2 (= ~c_num_read~0 0)) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not .cse12)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~q_free~0 1)) (.cse4 (<= 2 ~q_write_ev~0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)) (.cse9 (= ~p_dw_i~0 1)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse8 (<= 1 ~q_read_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~q_free~0 0) .cse7 (<= ~p_num_write~0 1) .cse8 .cse9 .cse10 (<= 1 ~p_num_write~0)) (and (= ~p_num_write~0 0) .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 (<= ~q_req_up~0 0) .cse12 (= ~q_read_ev~0 2) .cse9 .cse13 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and (let ((.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse3 .cse11 .cse4 (<= ~c_dr_pc~0 1) .cse5 .cse6 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse7 .cse14 .cse9 .cse13 .cse15) (and .cse0 .cse1 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7 .cse14 .cse9 .cse13 .cse10 .cse15))) .cse8)))) [2022-11-20 11:55:03,742 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse15 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse16 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse10 .cse3 .cse4 .cse15 .cse5 .cse12 .cse16 .cse13 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse15 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse15 .cse5 .cse12 .cse16 .cse13))) [2022-11-20 11:55:03,742 INFO L895 garLoopResultBuilder]: At program point L431-1(line 431) the Hoare annotation is: (let ((.cse8 (<= 1 ~c_dr_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse15 (= ~q_free~0 0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse16 (= ~q_read_ev~0 2)) (.cse13 (= ~p_dw_i~0 1))) (or (and (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13 .cse6 .cse14) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) (< ~c_num_read~0 ~p_num_write~0) .cse10 .cse3 .cse4 .cse15 .cse5 .cse12 .cse16 .cse13 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse8 .cse2 .cse9 .cse10 .cse3 .cse4 .cse11 .cse13 .cse6 .cse7 .cse14) (and .cse0 .cse1 .cse3 .cse4 .cse15 .cse13 (<= ~c_dr_pc~0 0)) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse4 .cse15 .cse5 .cse12 .cse16 .cse13))) [2022-11-20 11:55:03,742 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2022-11-20 11:55:03,742 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2022-11-20 11:55:03,743 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 61 79) no Hoare annotation was computed. [2022-11-20 11:55:03,743 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 61 79) no Hoare annotation was computed. [2022-11-20 11:55:03,743 INFO L895 garLoopResultBuilder]: At program point L76(lines 64 78) the Hoare annotation is: (let ((.cse14 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse18 (not (<= ~c_dr_pc~0 0))) (.cse19 (not (= ~p_num_write~0 0))) (.cse20 (not (= ~c_num_read~0 0))) (.cse3 (not (= ~q_free~0 0))) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~q_read_ev~0 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse12 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse1 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse4 (not (<= ~c_dr_pc~0 1))) (.cse5 (= ~p_dw_st~0 0)) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 1))) (.cse9 (not (<= ~q_req_up~0 0))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse2 .cse13 .cse4 .cse5 .cse14 .cse7 .cse15 .cse8 .cse16 .cse17 .cse11) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse5 .cse14 .cse8 .cse11) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse5 .cse8 .cse10 .cse11) (or .cse0 .cse19 .cse1 .cse2 .cse20 .cse5 .cse6 .cse14 .cse16 .cse17 .cse11) (or .cse18 (not .cse5) (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse19 .cse1 .cse2 .cse20 .cse6 .cse8 .cse16 .cse9 .cse10 .cse17 .cse11) (or .cse0 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse1 (not (< ~c_num_read~0 ~p_num_write~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~q_write_ev~0 0) .cse8 .cse9 .cse10 .cse11) (or .cse0 (= ~q_read_ev~0 1) .cse12 .cse1 .cse2 .cse13 .cse4 .cse5 .cse7 .cse15 .cse8 .cse16 .cse9 .cse17 .cse11))) [2022-11-20 11:55:03,744 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 61 79) the Hoare annotation is: true [2022-11-20 11:55:03,744 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2022-11-20 11:55:03,744 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2022-11-20 11:55:03,744 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-11-20 11:55:03,745 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 16 23) the Hoare annotation is: true [2022-11-20 11:55:03,745 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 16 23) no Hoare annotation was computed. [2022-11-20 11:55:03,749 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:55:03,752 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:55:03,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:55:03 BoogieIcfgContainer [2022-11-20 11:55:03,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:55:03,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:55:03,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:55:03,823 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:55:03,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:53:43" (3/4) ... [2022-11-20 11:55:03,828 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 11:55:03,836 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-20 11:55:03,836 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-20 11:55:03,837 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-20 11:55:03,837 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-20 11:55:03,837 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-20 11:55:03,837 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-20 11:55:03,838 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-20 11:55:03,838 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-20 11:55:03,846 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-20 11:55:03,847 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-20 11:55:03,847 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 11:55:03,848 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 11:55:03,880 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((c_dr_st == 0 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i)) [2022-11-20 11:55:03,932 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:55:03,933 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:55:03,939 INFO L158 Benchmark]: Toolchain (without parser) took 81088.48ms. Allocated memory was 178.3MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 131.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 184.6MB. Max. memory is 16.1GB. [2022-11-20 11:55:03,939 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 125.8MB. Free memory was 70.4MB in the beginning and 70.3MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:55:03,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.38ms. Allocated memory is still 178.3MB. Free memory was 131.1MB in the beginning and 118.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 11:55:03,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.99ms. Allocated memory is still 178.3MB. Free memory was 118.4MB in the beginning and 116.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:55:03,941 INFO L158 Benchmark]: Boogie Preprocessor took 31.13ms. Allocated memory is still 178.3MB. Free memory was 116.4MB in the beginning and 114.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 11:55:03,941 INFO L158 Benchmark]: RCFGBuilder took 623.99ms. Allocated memory is still 178.3MB. Free memory was 114.9MB in the beginning and 98.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 11:55:03,942 INFO L158 Benchmark]: TraceAbstraction took 79952.25ms. Allocated memory was 178.3MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 97.2MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-11-20 11:55:03,943 INFO L158 Benchmark]: Witness Printer took 110.18ms. Allocated memory is still 2.7GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 11:55:03,952 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.30ms. Allocated memory is still 125.8MB. Free memory was 70.4MB in the beginning and 70.3MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.38ms. Allocated memory is still 178.3MB. Free memory was 131.1MB in the beginning and 118.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.99ms. Allocated memory is still 178.3MB. Free memory was 118.4MB in the beginning and 116.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.13ms. Allocated memory is still 178.3MB. Free memory was 116.4MB in the beginning and 114.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 623.99ms. Allocated memory is still 178.3MB. Free memory was 114.9MB in the beginning and 98.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 79952.25ms. Allocated memory was 178.3MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 97.2MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 110.18ms. Allocated memory is still 2.7GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 79.8s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 35.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9267 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9073 mSDsluCounter, 8336 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6103 mSDsCounter, 2441 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9092 IncrementalHoareTripleChecker+Invalid, 11533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2441 mSolverCounterUnsat, 2233 mSDtfsCounter, 9092 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2315 GetRequests, 1977 SyntacticMatches, 14 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13027occurred in iteration=13, InterpolantAutomatonStates: 288, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 8264 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 11931 PreInvPairs, 12450 NumberOfFragments, 9614 HoareAnnotationTreeSize, 11931 FomulaSimplifications, 1456 FormulaSimplificationTreeSizeReduction, 6.8s HoareSimplificationTime, 41 FomulaSimplificationsInter, 246945 FormulaSimplificationTreeSizeReductionInter, 28.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 3134 NumberOfCodeBlocks, 3134 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3590 ConstructedInterpolants, 0 QuantifiedInterpolants, 7249 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3063 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 30 InterpolantComputations, 18 PerfectInterpolantSequences, 1916/1975 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) || ((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && c_num_read < p_num_write + 1)) && 1 <= q_read_ev) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || (((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || ((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: 1 == c_dr_i - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) || (((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0) || (((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1)) || (((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_dr_st == 0 || !(q_read_ev == 1)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || (((((1 <= c_dr_pc && c_dr_pc <= 1) && 1 == c_dr_i) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && ((((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || 0 < q_write_ev) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || q_write_ev == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && (((((((((((c_dr_st == 0 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || (((((1 <= c_dr_pc && c_dr_pc <= 1) && 1 == c_dr_i) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && 0 <= __retres1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((((c_dr_st == 0 || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((c_dr_st == 0 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 1 == c_dr_i - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 0 || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i)) && (((((((((((((c_dr_st == 0 || !(c_num_read < p_num_write + 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && ((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && ((((((((((c_dr_st == 0 || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_num_write <= c_num_read + 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || q_write_ev == 0) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i))) && ((((((((((((((c_dr_st == 0 || q_read_ev == 1) || !(c_num_read < p_num_write + 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i)) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 <= __retres1 || !(c_dr_pc <= 0)) || !(q_req_up == 1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(1 <= p_num_write)) || !(1 <= q_read_ev)) || (!(c_dr_st == 0) && q_read_ev == 2)) || !(p_num_write <= 1)) || !(1 == c_dr_i)) && (((((((1 <= __retres1 || c_dr_st == 0) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(p_dw_i == 1)) || !(1 == c_dr_i))) && (((((((((((((((1 <= __retres1 || c_dr_st == 0) || !(p_dw_st == 0)) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((1 <= __retres1 || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((1 <= __retres1 || c_dr_st == 0) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((1 <= __retres1 || c_dr_st == 0) || !(p_dw_st == 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc <= 1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((((((1 <= __retres1 || !(p_num_write <= c_num_read + 1)) || !(c_dr_st == 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(1 == c_dr_i)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) || (((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 <= q_write_ev) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read < p_num_write) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && c_num_read < p_num_write + 1)) || (((((p_last_write == q_buf_0 && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((((((p_last_write == q_buf_0 && 1 <= c_dr_pc) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && 1 <= tmp___1) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) || ((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && 1 <= tmp___1) && p_num_write <= c_num_read) && q_read_ev == 2) && p_dw_i == 1) && c_num_read < p_num_write + 1) - InvariantResult [Line: 448]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 1) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0 - InvariantResult [Line: 233]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 1) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 <= tmp___1) && q_read_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1) || (((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_dw_i == 1) && c_dr_pc <= 0)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= q_write_ev) && 1 == c_dr_i) && q_free == 0) && 1 <= tmp___1) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) RESULT: Ultimate proved your program to be correct! [2022-11-20 11:55:04,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5fa68b6b-e1f4-4f2f-bfac-9c557e229249/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE