./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:55:22,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:55:22,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:55:22,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:55:22,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:55:22,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:55:22,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:55:22,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:55:22,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:55:22,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:55:22,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:55:22,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:55:22,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:55:22,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:55:22,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:55:22,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:55:22,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:55:22,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:55:22,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:55:22,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:55:22,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:55:22,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:55:22,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:55:22,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:55:22,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:55:22,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:55:22,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:55:22,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:55:22,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:55:22,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:55:22,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:55:22,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:55:22,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:55:22,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:55:22,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:55:22,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:55:22,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:55:22,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:55:22,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:55:22,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:55:22,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:55:22,785 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:55:22,800 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:55:22,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:55:22,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:55:22,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:55:22,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:55:22,801 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:55:22,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:55:22,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:55:22,802 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:55:22,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:55:22,802 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:55:22,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:55:22,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:55:22,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:55:22,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:55:22,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:55:22,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:55:22,803 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:55:22,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:55:22,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:55:22,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:55:22,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:55:22,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:55:22,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:55:22,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:55:22,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:55:22,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:55:22,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:55:22,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:55:22,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:55:22,806 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:55:22,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:55:22,806 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:55:22,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:55:22,806 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:55:22,806 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ea93d7c6d06d46004840cc5fcb436c7c307334e6ee754b8ee507b78f644445d [2022-12-13 16:55:23,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:55:23,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:55:23,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:55:23,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:55:23,030 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:55:23,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-12-13 16:55:25,563 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:55:25,747 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:55:25,748 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-12-13 16:55:25,755 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/data/f313339d0/805458012a0f4be0ad8a5152ce83c789/FLAG927ee8596 [2022-12-13 16:55:26,145 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/data/f313339d0/805458012a0f4be0ad8a5152ce83c789 [2022-12-13 16:55:26,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:55:26,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:55:26,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:55:26,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:55:26,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:55:26,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38dcec6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26, skipping insertion in model container [2022-12-13 16:55:26,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:55:26,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:55:26,280 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_e661f375-348f-46d5-893c-c75384db2f3f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2022-12-13 16:55:26,314 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_e661f375-348f-46d5-893c-c75384db2f3f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2022-12-13 16:55:26,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:55:26,347 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:55:26,355 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_e661f375-348f-46d5-893c-c75384db2f3f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[914,927] [2022-12-13 16:55:26,368 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_e661f375-348f-46d5-893c-c75384db2f3f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-2.c[7115,7128] [2022-12-13 16:55:26,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:55:26,397 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:55:26,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26 WrapperNode [2022-12-13 16:55:26,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:55:26,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:55:26,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:55:26,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:55:26,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,432 INFO L138 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 465 [2022-12-13 16:55:26,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:55:26,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:55:26,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:55:26,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:55:26,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,455 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:55:26,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:55:26,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:55:26,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:55:26,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26" (1/1) ... [2022-12-13 16:55:26,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:55:26,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:55:26,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:55:26,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:55:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:55:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 16:55:26,517 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 16:55:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-13 16:55:26,517 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-13 16:55:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-13 16:55:26,517 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-13 16:55:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-13 16:55:26,517 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-13 16:55:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-12-13 16:55:26,518 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-12-13 16:55:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-13 16:55:26,518 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-13 16:55:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-13 16:55:26,518 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-13 16:55:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-12-13 16:55:26,518 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-12-13 16:55:26,518 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-13 16:55:26,518 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-13 16:55:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-12-13 16:55:26,519 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-12-13 16:55:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-13 16:55:26,519 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-13 16:55:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:55:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-13 16:55:26,519 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-13 16:55:26,519 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-12-13 16:55:26,519 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-12-13 16:55:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:55:26,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:55:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-13 16:55:26,520 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-13 16:55:26,520 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-12-13 16:55:26,520 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-12-13 16:55:26,591 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:55:26,593 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:55:26,978 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:55:26,984 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:55:26,984 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-13 16:55:26,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:55:26 BoogieIcfgContainer [2022-12-13 16:55:26,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:55:26,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:55:26,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:55:26,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:55:26,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:55:26" (1/3) ... [2022-12-13 16:55:26,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449d678e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:55:26, skipping insertion in model container [2022-12-13 16:55:26,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:26" (2/3) ... [2022-12-13 16:55:26,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449d678e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:55:26, skipping insertion in model container [2022-12-13 16:55:26,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:55:26" (3/3) ... [2022-12-13 16:55:26,993 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-2.c [2022-12-13 16:55:27,006 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:55:27,006 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 16:55:27,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:55:27,057 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;@35cf5bd6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:55:27,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 16:55:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 199 states have internal predecessors, (299), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-13 16:55:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 16:55:27,069 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:27,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:27,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:27,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:27,073 INFO L85 PathProgramCache]: Analyzing trace with hash -448089429, now seen corresponding path program 1 times [2022-12-13 16:55:27,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:27,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464304706] [2022-12-13 16:55:27,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:27,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:27,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:27,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:27,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:27,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:27,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:27,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:27,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:27,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464304706] [2022-12-13 16:55:27,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464304706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:27,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:27,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:55:27,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509929924] [2022-12-13 16:55:27,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:27,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:55:27,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:55:27,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:55:27,327 INFO L87 Difference]: Start difference. First operand has 241 states, 191 states have (on average 1.5654450261780104) internal successors, (299), 199 states have internal predecessors, (299), 32 states have call successors, (32), 15 states have call predecessors, (32), 15 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) 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), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 16:55:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:27,819 INFO L93 Difference]: Finished difference Result 482 states and 727 transitions. [2022-12-13 16:55:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 16:55:27,821 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), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 16:55:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:27,829 INFO L225 Difference]: With dead ends: 482 [2022-12-13 16:55:27,829 INFO L226 Difference]: Without dead ends: 248 [2022-12-13 16:55:27,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:55:27,835 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 357 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:27,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 779 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:55:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-12-13 16:55:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2022-12-13 16:55:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 183 states have (on average 1.46448087431694) internal successors, (268), 188 states have internal predecessors, (268), 32 states have call successors, (32), 15 states have call predecessors, (32), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-12-13 16:55:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 328 transitions. [2022-12-13 16:55:27,884 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 328 transitions. Word has length 65 [2022-12-13 16:55:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:27,885 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 328 transitions. [2022-12-13 16:55:27,885 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), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 16:55:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 328 transitions. [2022-12-13 16:55:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 16:55:27,887 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:27,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:27,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:55:27,888 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:27,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:27,888 INFO L85 PathProgramCache]: Analyzing trace with hash -488764179, now seen corresponding path program 1 times [2022-12-13 16:55:27,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:27,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571280275] [2022-12-13 16:55:27,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:27,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:27,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:28,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:28,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571280275] [2022-12-13 16:55:28,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571280275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:28,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:28,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:55:28,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025671567] [2022-12-13 16:55:28,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:28,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:55:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:28,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:55:28,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:55:28,056 INFO L87 Difference]: Start difference. First operand 230 states and 328 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 16:55:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:28,697 INFO L93 Difference]: Finished difference Result 453 states and 642 transitions. [2022-12-13 16:55:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 16:55:28,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 16:55:28,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:28,699 INFO L225 Difference]: With dead ends: 453 [2022-12-13 16:55:28,700 INFO L226 Difference]: Without dead ends: 365 [2022-12-13 16:55:28,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-12-13 16:55:28,701 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 605 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:28,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 848 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:55:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-12-13 16:55:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 326. [2022-12-13 16:55:28,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 259 states have (on average 1.4362934362934363) internal successors, (372), 266 states have internal predecessors, (372), 43 states have call successors, (43), 22 states have call predecessors, (43), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2022-12-13 16:55:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 459 transitions. [2022-12-13 16:55:28,729 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 459 transitions. Word has length 65 [2022-12-13 16:55:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:28,729 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 459 transitions. [2022-12-13 16:55:28,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 16:55:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 459 transitions. [2022-12-13 16:55:28,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 16:55:28,731 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:28,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:28,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:55:28,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:28,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1049575851, now seen corresponding path program 1 times [2022-12-13 16:55:28,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:28,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023014352] [2022-12-13 16:55:28,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:28,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:28,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:28,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023014352] [2022-12-13 16:55:28,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023014352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:28,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:28,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:55:28,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117375903] [2022-12-13 16:55:28,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:28,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:55:28,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:28,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:55:28,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:55:28,878 INFO L87 Difference]: Start difference. First operand 326 states and 459 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 16:55:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:29,467 INFO L93 Difference]: Finished difference Result 540 states and 753 transitions. [2022-12-13 16:55:29,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:55:29,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-12-13 16:55:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:29,469 INFO L225 Difference]: With dead ends: 540 [2022-12-13 16:55:29,469 INFO L226 Difference]: Without dead ends: 363 [2022-12-13 16:55:29,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 16:55:29,471 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 259 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:29,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1342 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:55:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-12-13 16:55:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 331. [2022-12-13 16:55:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 263 states have (on average 1.4258555133079849) internal successors, (375), 270 states have internal predecessors, (375), 43 states have call successors, (43), 22 states have call predecessors, (43), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2022-12-13 16:55:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 463 transitions. [2022-12-13 16:55:29,492 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 463 transitions. Word has length 65 [2022-12-13 16:55:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:29,492 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 463 transitions. [2022-12-13 16:55:29,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 16:55:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 463 transitions. [2022-12-13 16:55:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 16:55:29,496 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:29,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:29,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:55:29,496 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:29,497 INFO L85 PathProgramCache]: Analyzing trace with hash 20216553, now seen corresponding path program 1 times [2022-12-13 16:55:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:29,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422734878] [2022-12-13 16:55:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:29,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:29,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:29,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:29,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:29,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:29,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:29,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422734878] [2022-12-13 16:55:29,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422734878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:29,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:29,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 16:55:29,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213993275] [2022-12-13 16:55:29,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:29,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:55:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:29,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:55:29,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:55:29,619 INFO L87 Difference]: Start difference. First operand 331 states and 463 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 16:55:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:30,917 INFO L93 Difference]: Finished difference Result 1231 states and 1681 transitions. [2022-12-13 16:55:30,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 16:55:30,917 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-12-13 16:55:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:30,922 INFO L225 Difference]: With dead ends: 1231 [2022-12-13 16:55:30,922 INFO L226 Difference]: Without dead ends: 1037 [2022-12-13 16:55:30,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 16:55:30,925 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 1925 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:30,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 1546 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 16:55:30,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-12-13 16:55:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 912. [2022-12-13 16:55:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 725 states have (on average 1.3655172413793104) internal successors, (990), 740 states have internal predecessors, (990), 100 states have call successors, (100), 75 states have call predecessors, (100), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2022-12-13 16:55:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1204 transitions. [2022-12-13 16:55:30,998 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1204 transitions. Word has length 65 [2022-12-13 16:55:30,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:30,998 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1204 transitions. [2022-12-13 16:55:30,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 16:55:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1204 transitions. [2022-12-13 16:55:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 16:55:31,000 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:31,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:31,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:55:31,000 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:31,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:31,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1071665642, now seen corresponding path program 1 times [2022-12-13 16:55:31,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:31,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960049646] [2022-12-13 16:55:31,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:31,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:31,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:31,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960049646] [2022-12-13 16:55:31,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960049646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:31,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:31,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:55:31,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776580402] [2022-12-13 16:55:31,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:31,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:55:31,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:31,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:55:31,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:55:31,139 INFO L87 Difference]: Start difference. First operand 912 states and 1204 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 16:55:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:31,706 INFO L93 Difference]: Finished difference Result 1793 states and 2347 transitions. [2022-12-13 16:55:31,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 16:55:31,707 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2022-12-13 16:55:31,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:31,712 INFO L225 Difference]: With dead ends: 1793 [2022-12-13 16:55:31,712 INFO L226 Difference]: Without dead ends: 1024 [2022-12-13 16:55:31,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 16:55:31,715 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 382 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:31,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1195 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:55:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2022-12-13 16:55:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 932. [2022-12-13 16:55:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 756 states have internal predecessors, (1001), 100 states have call successors, (100), 75 states have call predecessors, (100), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2022-12-13 16:55:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1219 transitions. [2022-12-13 16:55:31,773 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1219 transitions. Word has length 65 [2022-12-13 16:55:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:31,774 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 1219 transitions. [2022-12-13 16:55:31,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 16:55:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1219 transitions. [2022-12-13 16:55:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 16:55:31,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:31,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:31,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:55:31,775 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1837098260, now seen corresponding path program 1 times [2022-12-13 16:55:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:31,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819179462] [2022-12-13 16:55:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:31,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:31,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819179462] [2022-12-13 16:55:31,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819179462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:31,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:31,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:55:31,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455531938] [2022-12-13 16:55:31,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:31,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:55:31,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:31,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:55:31,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:55:31,921 INFO L87 Difference]: Start difference. First operand 932 states and 1219 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 16:55:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:32,609 INFO L93 Difference]: Finished difference Result 2500 states and 3166 transitions. [2022-12-13 16:55:32,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 16:55:32,609 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 16:55:32,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:32,617 INFO L225 Difference]: With dead ends: 2500 [2022-12-13 16:55:32,617 INFO L226 Difference]: Without dead ends: 1712 [2022-12-13 16:55:32,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-12-13 16:55:32,620 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 657 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:32,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1012 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:55:32,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-12-13 16:55:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1380. [2022-12-13 16:55:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1094 states have (on average 1.3254113345521024) internal successors, (1450), 1118 states have internal predecessors, (1450), 146 states have call successors, (146), 114 states have call predecessors, (146), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2022-12-13 16:55:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1786 transitions. [2022-12-13 16:55:32,727 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1786 transitions. Word has length 65 [2022-12-13 16:55:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:32,728 INFO L495 AbstractCegarLoop]: Abstraction has 1380 states and 1786 transitions. [2022-12-13 16:55:32,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 16:55:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1786 transitions. [2022-12-13 16:55:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 16:55:32,729 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:32,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:32,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:55:32,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:32,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:32,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1971111766, now seen corresponding path program 1 times [2022-12-13 16:55:32,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:32,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403083219] [2022-12-13 16:55:32,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:32,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:32,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:32,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:32,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:32,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:32,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:32,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:32,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:32,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:32,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403083219] [2022-12-13 16:55:32,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403083219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:32,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:32,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:55:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594436297] [2022-12-13 16:55:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:32,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:55:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:55:32,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:55:32,824 INFO L87 Difference]: Start difference. First operand 1380 states and 1786 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 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-12-13 16:55:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:33,349 INFO L93 Difference]: Finished difference Result 3851 states and 4925 transitions. [2022-12-13 16:55:33,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 16:55:33,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 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 65 [2022-12-13 16:55:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:33,360 INFO L225 Difference]: With dead ends: 3851 [2022-12-13 16:55:33,361 INFO L226 Difference]: Without dead ends: 2617 [2022-12-13 16:55:33,364 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-12-13 16:55:33,365 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 784 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:33,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 671 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:55:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2022-12-13 16:55:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2509. [2022-12-13 16:55:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 1963 states have (on average 1.2745797249108508) internal successors, (2502), 2008 states have internal predecessors, (2502), 270 states have call successors, (270), 220 states have call predecessors, (270), 274 states have return successors, (398), 283 states have call predecessors, (398), 266 states have call successors, (398) [2022-12-13 16:55:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3170 transitions. [2022-12-13 16:55:33,497 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3170 transitions. Word has length 65 [2022-12-13 16:55:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:33,498 INFO L495 AbstractCegarLoop]: Abstraction has 2509 states and 3170 transitions. [2022-12-13 16:55:33,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 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-12-13 16:55:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3170 transitions. [2022-12-13 16:55:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 16:55:33,499 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:33,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:33,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:55:33,499 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash -291684510, now seen corresponding path program 1 times [2022-12-13 16:55:33,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:33,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210719758] [2022-12-13 16:55:33,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:33,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:33,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:33,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:33,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:33,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:33,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:33,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210719758] [2022-12-13 16:55:33,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210719758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:33,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:33,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:55:33,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602407853] [2022-12-13 16:55:33,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:33,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:55:33,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:33,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:55:33,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:55:33,553 INFO L87 Difference]: Start difference. First operand 2509 states and 3170 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 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-12-13 16:55:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:34,056 INFO L93 Difference]: Finished difference Result 5831 states and 7344 transitions. [2022-12-13 16:55:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:55:34,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 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 66 [2022-12-13 16:55:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:34,066 INFO L225 Difference]: With dead ends: 5831 [2022-12-13 16:55:34,066 INFO L226 Difference]: Without dead ends: 3468 [2022-12-13 16:55:34,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:55:34,070 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 434 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:34,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 795 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:55:34,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2022-12-13 16:55:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3214. [2022-12-13 16:55:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 2511 states have (on average 1.2652329749103943) internal successors, (3177), 2562 states have internal predecessors, (3177), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-12-13 16:55:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4017 transitions. [2022-12-13 16:55:34,223 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4017 transitions. Word has length 66 [2022-12-13 16:55:34,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:34,224 INFO L495 AbstractCegarLoop]: Abstraction has 3214 states and 4017 transitions. [2022-12-13 16:55:34,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 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-12-13 16:55:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4017 transitions. [2022-12-13 16:55:34,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 16:55:34,225 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:34,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:34,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:55:34,225 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:34,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash 342944188, now seen corresponding path program 1 times [2022-12-13 16:55:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:34,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167379224] [2022-12-13 16:55:34,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:34,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:34,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:34,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:55:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:34,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:55:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:34,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:55:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:34,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:34,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167379224] [2022-12-13 16:55:34,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167379224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:34,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:34,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:55:34,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192525883] [2022-12-13 16:55:34,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:34,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:55:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:34,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:55:34,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:55:34,273 INFO L87 Difference]: Start difference. First operand 3214 states and 4017 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:34,737 INFO L93 Difference]: Finished difference Result 3374 states and 4261 transitions. [2022-12-13 16:55:34,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:55:34,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 16:55:34,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:34,745 INFO L225 Difference]: With dead ends: 3374 [2022-12-13 16:55:34,745 INFO L226 Difference]: Without dead ends: 3246 [2022-12-13 16:55:34,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:55:34,747 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 400 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:34,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 531 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:55:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2022-12-13 16:55:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3214. [2022-12-13 16:55:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3214 states, 2511 states have (on average 1.2648347272003186) internal successors, (3176), 2562 states have internal predecessors, (3176), 346 states have call successors, (346), 286 states have call predecessors, (346), 355 states have return successors, (494), 368 states have call predecessors, (494), 342 states have call successors, (494) [2022-12-13 16:55:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 4016 transitions. [2022-12-13 16:55:34,937 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 4016 transitions. Word has length 69 [2022-12-13 16:55:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:34,937 INFO L495 AbstractCegarLoop]: Abstraction has 3214 states and 4016 transitions. [2022-12-13 16:55:34,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 4016 transitions. [2022-12-13 16:55:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 16:55:34,938 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:34,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:34,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:55:34,938 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:34,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1618630470, now seen corresponding path program 1 times [2022-12-13 16:55:34,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:34,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899759940] [2022-12-13 16:55:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:34,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:34,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:34,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:55:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:35,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:55:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:35,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:55:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:35,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:35,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899759940] [2022-12-13 16:55:35,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899759940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:35,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:35,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:55:35,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772437843] [2022-12-13 16:55:35,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:35,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:55:35,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:35,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:55:35,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:55:35,008 INFO L87 Difference]: Start difference. First operand 3214 states and 4016 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:35,817 INFO L93 Difference]: Finished difference Result 3524 states and 4487 transitions. [2022-12-13 16:55:35,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:55:35,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 16:55:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:35,829 INFO L225 Difference]: With dead ends: 3524 [2022-12-13 16:55:35,829 INFO L226 Difference]: Without dead ends: 3400 [2022-12-13 16:55:35,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:55:35,831 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 645 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:35,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 719 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:55:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2022-12-13 16:55:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3335. [2022-12-13 16:55:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3335 states, 2614 states have (on average 1.2746748278500382) internal successors, (3332), 2666 states have internal predecessors, (3332), 357 states have call successors, (357), 292 states have call predecessors, (357), 362 states have return successors, (508), 379 states have call predecessors, (508), 353 states have call successors, (508) [2022-12-13 16:55:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3335 states to 3335 states and 4197 transitions. [2022-12-13 16:55:36,039 INFO L78 Accepts]: Start accepts. Automaton has 3335 states and 4197 transitions. Word has length 69 [2022-12-13 16:55:36,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:36,039 INFO L495 AbstractCegarLoop]: Abstraction has 3335 states and 4197 transitions. [2022-12-13 16:55:36,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:36,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4197 transitions. [2022-12-13 16:55:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 16:55:36,040 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:36,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:36,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:55:36,040 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:36,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1515916106, now seen corresponding path program 1 times [2022-12-13 16:55:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:36,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401215784] [2022-12-13 16:55:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:36,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:36,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:36,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:36,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:55:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:36,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:55:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:36,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:55:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:36,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:36,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401215784] [2022-12-13 16:55:36,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401215784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:36,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:36,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:55:36,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160983103] [2022-12-13 16:55:36,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:36,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:55:36,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:36,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:55:36,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:55:36,123 INFO L87 Difference]: Start difference. First operand 3335 states and 4197 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:36,995 INFO L93 Difference]: Finished difference Result 3797 states and 4891 transitions. [2022-12-13 16:55:36,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 16:55:36,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 16:55:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:37,005 INFO L225 Difference]: With dead ends: 3797 [2022-12-13 16:55:37,005 INFO L226 Difference]: Without dead ends: 3552 [2022-12-13 16:55:37,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 16:55:37,007 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 646 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:37,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1170 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:55:37,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3552 states. [2022-12-13 16:55:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3552 to 3449. [2022-12-13 16:55:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 2710 states have (on average 1.2819188191881918) internal successors, (3474), 2763 states have internal predecessors, (3474), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-12-13 16:55:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4363 transitions. [2022-12-13 16:55:37,212 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4363 transitions. Word has length 69 [2022-12-13 16:55:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:37,212 INFO L495 AbstractCegarLoop]: Abstraction has 3449 states and 4363 transitions. [2022-12-13 16:55:37,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4363 transitions. [2022-12-13 16:55:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 16:55:37,213 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:37,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:37,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 16:55:37,213 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:37,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash -129130696, now seen corresponding path program 1 times [2022-12-13 16:55:37,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:37,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101353768] [2022-12-13 16:55:37,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:37,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:37,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:37,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:55:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:37,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:55:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:37,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:55:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:37,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:37,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101353768] [2022-12-13 16:55:37,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101353768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:37,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:37,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:55:37,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615687594] [2022-12-13 16:55:37,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:37,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:55:37,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:37,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:55:37,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:55:37,287 INFO L87 Difference]: Start difference. First operand 3449 states and 4363 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:37,988 INFO L93 Difference]: Finished difference Result 3907 states and 5057 transitions. [2022-12-13 16:55:37,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:55:37,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 16:55:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:37,998 INFO L225 Difference]: With dead ends: 3907 [2022-12-13 16:55:37,998 INFO L226 Difference]: Without dead ends: 3548 [2022-12-13 16:55:38,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:55:38,000 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 656 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:38,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 588 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:55:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2022-12-13 16:55:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3449. [2022-12-13 16:55:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 2710 states have (on average 1.2808118081180813) internal successors, (3471), 2763 states have internal predecessors, (3471), 368 states have call successors, (368), 298 states have call predecessors, (368), 369 states have return successors, (521), 391 states have call predecessors, (521), 364 states have call successors, (521) [2022-12-13 16:55:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4360 transitions. [2022-12-13 16:55:38,238 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4360 transitions. Word has length 69 [2022-12-13 16:55:38,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:38,238 INFO L495 AbstractCegarLoop]: Abstraction has 3449 states and 4360 transitions. [2022-12-13 16:55:38,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4360 transitions. [2022-12-13 16:55:38,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 16:55:38,240 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:38,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:38,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 16:55:38,240 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:38,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash 314769978, now seen corresponding path program 1 times [2022-12-13 16:55:38,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:38,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974899053] [2022-12-13 16:55:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:38,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:38,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:38,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:55:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:55:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:55:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:38,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:38,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974899053] [2022-12-13 16:55:38,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974899053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:38,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:38,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:55:38,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955388784] [2022-12-13 16:55:38,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:38,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:55:38,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:38,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:55:38,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:55:38,320 INFO L87 Difference]: Start difference. First operand 3449 states and 4360 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:39,312 INFO L93 Difference]: Finished difference Result 4243 states and 5535 transitions. [2022-12-13 16:55:39,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 16:55:39,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 16:55:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:39,321 INFO L225 Difference]: With dead ends: 4243 [2022-12-13 16:55:39,322 INFO L226 Difference]: Without dead ends: 3884 [2022-12-13 16:55:39,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 16:55:39,325 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 689 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:39,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1154 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 16:55:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2022-12-13 16:55:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3658. [2022-12-13 16:55:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 2885 states have (on average 1.2908145580589254) internal successors, (3724), 2940 states have internal predecessors, (3724), 388 states have call successors, (388), 310 states have call predecessors, (388), 383 states have return successors, (549), 413 states have call predecessors, (549), 384 states have call successors, (549) [2022-12-13 16:55:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4661 transitions. [2022-12-13 16:55:39,570 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4661 transitions. Word has length 69 [2022-12-13 16:55:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:39,570 INFO L495 AbstractCegarLoop]: Abstraction has 3658 states and 4661 transitions. [2022-12-13 16:55:39,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4661 transitions. [2022-12-13 16:55:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 16:55:39,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:39,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:39,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 16:55:39,572 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:39,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:39,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1853110008, now seen corresponding path program 1 times [2022-12-13 16:55:39,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:39,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242195159] [2022-12-13 16:55:39,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:39,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:39,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:55:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:39,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:55:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:39,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:55:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:39,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:39,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242195159] [2022-12-13 16:55:39,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242195159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:39,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:39,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:55:39,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523586627] [2022-12-13 16:55:39,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:39,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:55:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:55:39,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:55:39,663 INFO L87 Difference]: Start difference. First operand 3658 states and 4661 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:40,642 INFO L93 Difference]: Finished difference Result 4946 states and 6542 transitions. [2022-12-13 16:55:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 16:55:40,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 16:55:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:40,654 INFO L225 Difference]: With dead ends: 4946 [2022-12-13 16:55:40,654 INFO L226 Difference]: Without dead ends: 4378 [2022-12-13 16:55:40,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 16:55:40,657 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 632 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:40,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1158 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 16:55:40,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states. [2022-12-13 16:55:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 4089. [2022-12-13 16:55:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4089 states, 3250 states have (on average 1.3101538461538462) internal successors, (4258), 3309 states have internal predecessors, (4258), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2022-12-13 16:55:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 5293 transitions. [2022-12-13 16:55:40,915 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 5293 transitions. Word has length 69 [2022-12-13 16:55:40,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:40,915 INFO L495 AbstractCegarLoop]: Abstraction has 4089 states and 5293 transitions. [2022-12-13 16:55:40,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:40,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 5293 transitions. [2022-12-13 16:55:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 16:55:40,917 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:40,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:40,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 16:55:40,917 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash -175476102, now seen corresponding path program 1 times [2022-12-13 16:55:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:40,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105981536] [2022-12-13 16:55:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:40,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:40,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:40,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:40,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:55:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:40,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:55:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:40,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:55:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:40,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:40,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105981536] [2022-12-13 16:55:40,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105981536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:40,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:40,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:55:40,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446956114] [2022-12-13 16:55:40,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:40,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:55:40,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:40,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:55:40,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:55:40,997 INFO L87 Difference]: Start difference. First operand 4089 states and 5293 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:41,902 INFO L93 Difference]: Finished difference Result 5625 states and 7572 transitions. [2022-12-13 16:55:41,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:55:41,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 16:55:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:41,912 INFO L225 Difference]: With dead ends: 5625 [2022-12-13 16:55:41,912 INFO L226 Difference]: Without dead ends: 4627 [2022-12-13 16:55:41,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:55:41,916 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 370 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:41,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 993 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:55:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2022-12-13 16:55:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 4116. [2022-12-13 16:55:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4116 states, 3277 states have (on average 1.3075984131827891) internal successors, (4285), 3336 states have internal predecessors, (4285), 426 states have call successors, (426), 334 states have call predecessors, (426), 411 states have return successors, (609), 455 states have call predecessors, (609), 422 states have call successors, (609) [2022-12-13 16:55:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4116 states to 4116 states and 5320 transitions. [2022-12-13 16:55:42,267 INFO L78 Accepts]: Start accepts. Automaton has 4116 states and 5320 transitions. Word has length 69 [2022-12-13 16:55:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:42,267 INFO L495 AbstractCegarLoop]: Abstraction has 4116 states and 5320 transitions. [2022-12-13 16:55:42,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4116 states and 5320 transitions. [2022-12-13 16:55:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 16:55:42,269 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:42,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:42,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 16:55:42,269 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash 72670392, now seen corresponding path program 1 times [2022-12-13 16:55:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:42,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859038126] [2022-12-13 16:55:42,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:42,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:42,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:42,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:42,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:55:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:42,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:55:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:42,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:55:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:42,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:42,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859038126] [2022-12-13 16:55:42,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859038126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:42,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:42,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:55:42,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293914958] [2022-12-13 16:55:42,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:42,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:55:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:42,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:55:42,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:55:42,369 INFO L87 Difference]: Start difference. First operand 4116 states and 5320 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:43,824 INFO L93 Difference]: Finished difference Result 7610 states and 10576 transitions. [2022-12-13 16:55:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 16:55:43,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 16:55:43,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:43,836 INFO L225 Difference]: With dead ends: 7610 [2022-12-13 16:55:43,837 INFO L226 Difference]: Without dead ends: 6585 [2022-12-13 16:55:43,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-13 16:55:43,840 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 1396 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:43,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 949 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 16:55:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6585 states. [2022-12-13 16:55:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6585 to 6034. [2022-12-13 16:55:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6034 states, 4873 states have (on average 1.3435255489431561) internal successors, (6547), 4963 states have internal predecessors, (6547), 618 states have call successors, (618), 448 states have call predecessors, (618), 541 states have return successors, (918), 632 states have call predecessors, (918), 614 states have call successors, (918) [2022-12-13 16:55:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6034 states to 6034 states and 8083 transitions. [2022-12-13 16:55:44,252 INFO L78 Accepts]: Start accepts. Automaton has 6034 states and 8083 transitions. Word has length 69 [2022-12-13 16:55:44,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:44,252 INFO L495 AbstractCegarLoop]: Abstraction has 6034 states and 8083 transitions. [2022-12-13 16:55:44,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 16:55:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 6034 states and 8083 transitions. [2022-12-13 16:55:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-12-13 16:55:44,253 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:44,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:44,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 16:55:44,254 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 867157537, now seen corresponding path program 1 times [2022-12-13 16:55:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:44,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459908132] [2022-12-13 16:55:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:44,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:44,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:44,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:44,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:44,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:44,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:44,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:44,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459908132] [2022-12-13 16:55:44,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459908132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:44,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:44,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:55:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906416757] [2022-12-13 16:55:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:44,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:55:44,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:44,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:55:44,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:55:44,310 INFO L87 Difference]: Start difference. First operand 6034 states and 8083 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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-12-13 16:55:45,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:45,213 INFO L93 Difference]: Finished difference Result 9620 states and 12513 transitions. [2022-12-13 16:55:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:55:45,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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 72 [2022-12-13 16:55:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:45,226 INFO L225 Difference]: With dead ends: 9620 [2022-12-13 16:55:45,226 INFO L226 Difference]: Without dead ends: 6550 [2022-12-13 16:55:45,230 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-12-13 16:55:45,230 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 583 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:45,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 725 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:55:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6550 states. [2022-12-13 16:55:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6550 to 6317. [2022-12-13 16:55:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6317 states, 5098 states have (on average 1.3367987446057277) internal successors, (6815), 5191 states have internal predecessors, (6815), 646 states have call successors, (646), 473 states have call predecessors, (646), 571 states have return successors, (952), 662 states have call predecessors, (952), 642 states have call successors, (952) [2022-12-13 16:55:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6317 states to 6317 states and 8413 transitions. [2022-12-13 16:55:45,703 INFO L78 Accepts]: Start accepts. Automaton has 6317 states and 8413 transitions. Word has length 72 [2022-12-13 16:55:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:45,704 INFO L495 AbstractCegarLoop]: Abstraction has 6317 states and 8413 transitions. [2022-12-13 16:55:45,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 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-12-13 16:55:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 6317 states and 8413 transitions. [2022-12-13 16:55:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 16:55:45,705 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:45,705 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-12-13 16:55:45,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 16:55:45,706 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash 595856072, now seen corresponding path program 1 times [2022-12-13 16:55:45,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:45,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471985054] [2022-12-13 16:55:45,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:45,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:45,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:45,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:45,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:45,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:45,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:45,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471985054] [2022-12-13 16:55:45,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471985054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:45,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:45,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:55:45,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785435037] [2022-12-13 16:55:45,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:45,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:55:45,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:45,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:55:45,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:55:45,768 INFO L87 Difference]: Start difference. First operand 6317 states and 8413 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 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-12-13 16:55:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:46,751 INFO L93 Difference]: Finished difference Result 7371 states and 9680 transitions. [2022-12-13 16:55:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 16:55:46,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 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 73 [2022-12-13 16:55:46,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:46,767 INFO L225 Difference]: With dead ends: 7371 [2022-12-13 16:55:46,768 INFO L226 Difference]: Without dead ends: 7368 [2022-12-13 16:55:46,769 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-12-13 16:55:46,770 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 906 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:46,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 702 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:55:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7368 states. [2022-12-13 16:55:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7368 to 7074. [2022-12-13 16:55:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7074 states, 5676 states have (on average 1.3238195912614517) internal successors, (7514), 5776 states have internal predecessors, (7514), 729 states have call successors, (729), 545 states have call predecessors, (729), 667 states have return successors, (1080), 762 states have call predecessors, (1080), 726 states have call successors, (1080) [2022-12-13 16:55:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7074 states to 7074 states and 9323 transitions. [2022-12-13 16:55:47,393 INFO L78 Accepts]: Start accepts. Automaton has 7074 states and 9323 transitions. Word has length 73 [2022-12-13 16:55:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:47,393 INFO L495 AbstractCegarLoop]: Abstraction has 7074 states and 9323 transitions. [2022-12-13 16:55:47,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 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-12-13 16:55:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7074 states and 9323 transitions. [2022-12-13 16:55:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 16:55:47,395 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:47,395 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, 1] [2022-12-13 16:55:47,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 16:55:47,395 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:47,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:47,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1290941259, now seen corresponding path program 1 times [2022-12-13 16:55:47,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:47,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627859377] [2022-12-13 16:55:47,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:47,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:47,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:47,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:47,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:47,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:47,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:47,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:47,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:47,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627859377] [2022-12-13 16:55:47,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627859377] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:55:47,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762596538] [2022-12-13 16:55:47,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:47,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:55:47,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:55:47,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:55:47,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 16:55:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:47,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 16:55:47,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:55:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:47,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:55:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:47,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762596538] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:55:47,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:55:47,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-12-13 16:55:47,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881076603] [2022-12-13 16:55:47,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:55:47,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:55:47,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:47,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:55:47,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:55:47,934 INFO L87 Difference]: Start difference. First operand 7074 states and 9323 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 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-12-13 16:55:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:50,006 INFO L93 Difference]: Finished difference Result 11493 states and 14697 transitions. [2022-12-13 16:55:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 16:55:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 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 74 [2022-12-13 16:55:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:50,031 INFO L225 Difference]: With dead ends: 11493 [2022-12-13 16:55:50,031 INFO L226 Difference]: Without dead ends: 11490 [2022-12-13 16:55:50,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-12-13 16:55:50,035 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 1266 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:50,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 1534 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 16:55:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11490 states. [2022-12-13 16:55:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11490 to 10633. [2022-12-13 16:55:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10633 states, 8461 states have (on average 1.2938186975534807) internal successors, (10947), 8612 states have internal predecessors, (10947), 1099 states have call successors, (1099), 870 states have call predecessors, (1099), 1071 states have return successors, (1626), 1160 states have call predecessors, (1626), 1096 states have call successors, (1626) [2022-12-13 16:55:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 13672 transitions. [2022-12-13 16:55:51,025 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 13672 transitions. Word has length 74 [2022-12-13 16:55:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:51,025 INFO L495 AbstractCegarLoop]: Abstraction has 10633 states and 13672 transitions. [2022-12-13 16:55:51,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 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-12-13 16:55:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 13672 transitions. [2022-12-13 16:55:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 16:55:51,027 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:51,027 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, 1] [2022-12-13 16:55:51,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:55:51,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:55:51,228 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:51,229 INFO L85 PathProgramCache]: Analyzing trace with hash 372887048, now seen corresponding path program 2 times [2022-12-13 16:55:51,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:51,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337479885] [2022-12-13 16:55:51,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:51,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:51,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:51,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:51,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:51,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:51,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:51,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:51,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:55:51,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:51,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337479885] [2022-12-13 16:55:51,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337479885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:51,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:51,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:55:51,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826788725] [2022-12-13 16:55:51,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:51,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:55:51,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:51,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:55:51,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:55:51,295 INFO L87 Difference]: Start difference. First operand 10633 states and 13672 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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-12-13 16:55:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:52,256 INFO L93 Difference]: Finished difference Result 13642 states and 17396 transitions. [2022-12-13 16:55:52,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:55:52,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 77 [2022-12-13 16:55:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:52,268 INFO L225 Difference]: With dead ends: 13642 [2022-12-13 16:55:52,268 INFO L226 Difference]: Without dead ends: 6844 [2022-12-13 16:55:52,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:55:52,276 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 533 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:52,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 765 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:55:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6844 states. [2022-12-13 16:55:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6844 to 5818. [2022-12-13 16:55:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5818 states, 4712 states have (on average 1.330220713073005) internal successors, (6268), 4785 states have internal predecessors, (6268), 599 states have call successors, (599), 435 states have call predecessors, (599), 505 states have return successors, (852), 607 states have call predecessors, (852), 596 states have call successors, (852) [2022-12-13 16:55:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 7719 transitions. [2022-12-13 16:55:52,776 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 7719 transitions. Word has length 77 [2022-12-13 16:55:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:52,776 INFO L495 AbstractCegarLoop]: Abstraction has 5818 states and 7719 transitions. [2022-12-13 16:55:52,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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-12-13 16:55:52,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 7719 transitions. [2022-12-13 16:55:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 16:55:52,778 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:52,778 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, 1] [2022-12-13 16:55:52,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 16:55:52,779 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:52,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:52,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1502182211, now seen corresponding path program 1 times [2022-12-13 16:55:52,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:52,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583107754] [2022-12-13 16:55:52,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:52,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:52,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:52,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:52,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:52,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:52,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:52,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:52,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 16:55:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:55:52,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:52,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583107754] [2022-12-13 16:55:52,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583107754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:52,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:52,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:55:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191378545] [2022-12-13 16:55:52,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:52,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:55:52,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:52,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:55:52,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:55:52,853 INFO L87 Difference]: Start difference. First operand 5818 states and 7719 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 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-12-13 16:55:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:54,348 INFO L93 Difference]: Finished difference Result 11542 states and 14643 transitions. [2022-12-13 16:55:54,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 16:55:54,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 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 84 [2022-12-13 16:55:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:54,362 INFO L225 Difference]: With dead ends: 11542 [2022-12-13 16:55:54,362 INFO L226 Difference]: Without dead ends: 7746 [2022-12-13 16:55:54,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-12-13 16:55:54,367 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 730 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:54,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 1070 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:55:54,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7746 states. [2022-12-13 16:55:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7746 to 7515. [2022-12-13 16:55:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7515 states, 6006 states have (on average 1.2938727938727939) internal successors, (7771), 6116 states have internal predecessors, (7771), 783 states have call successors, (783), 593 states have call predecessors, (783), 724 states have return successors, (1173), 815 states have call predecessors, (1173), 780 states have call successors, (1173) [2022-12-13 16:55:55,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7515 states to 7515 states and 9727 transitions. [2022-12-13 16:55:55,030 INFO L78 Accepts]: Start accepts. Automaton has 7515 states and 9727 transitions. Word has length 84 [2022-12-13 16:55:55,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:55,030 INFO L495 AbstractCegarLoop]: Abstraction has 7515 states and 9727 transitions. [2022-12-13 16:55:55,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 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-12-13 16:55:55,030 INFO L276 IsEmpty]: Start isEmpty. Operand 7515 states and 9727 transitions. [2022-12-13 16:55:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-13 16:55:55,033 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:55,033 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, 1] [2022-12-13 16:55:55,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 16:55:55,033 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:55,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash 905485990, now seen corresponding path program 1 times [2022-12-13 16:55:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:55,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836119422] [2022-12-13 16:55:55,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:55,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:55,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:55,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:55,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 16:55:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 16:55:55,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:55,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836119422] [2022-12-13 16:55:55,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836119422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:55,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:55,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:55:55,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640986678] [2022-12-13 16:55:55,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:55,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:55:55,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:55,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:55:55,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:55:55,112 INFO L87 Difference]: Start difference. First operand 7515 states and 9727 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 16:55:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:56,441 INFO L93 Difference]: Finished difference Result 10394 states and 13211 transitions. [2022-12-13 16:55:56,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 16:55:56,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-12-13 16:55:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:56,454 INFO L225 Difference]: With dead ends: 10394 [2022-12-13 16:55:56,454 INFO L226 Difference]: Without dead ends: 6580 [2022-12-13 16:55:56,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-12-13 16:55:56,458 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 1392 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:56,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 916 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 16:55:56,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2022-12-13 16:55:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 6203. [2022-12-13 16:55:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6203 states, 4978 states have (on average 1.3045399758939333) internal successors, (6494), 5071 states have internal predecessors, (6494), 641 states have call successors, (641), 469 states have call predecessors, (641), 582 states have return successors, (938), 672 states have call predecessors, (938), 638 states have call successors, (938) [2022-12-13 16:55:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6203 states to 6203 states and 8073 transitions. [2022-12-13 16:55:57,140 INFO L78 Accepts]: Start accepts. Automaton has 6203 states and 8073 transitions. Word has length 93 [2022-12-13 16:55:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:57,140 INFO L495 AbstractCegarLoop]: Abstraction has 6203 states and 8073 transitions. [2022-12-13 16:55:57,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 16:55:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 6203 states and 8073 transitions. [2022-12-13 16:55:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-13 16:55:57,145 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:57,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:57,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 16:55:57,145 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:57,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash -33791116, now seen corresponding path program 1 times [2022-12-13 16:55:57,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:57,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712709858] [2022-12-13 16:55:57,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:57,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:57,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:57,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:55:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:57,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:55:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:57,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:55:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:57,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 16:55:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:57,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:55:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:57,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:55:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 16:55:57,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:57,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712709858] [2022-12-13 16:55:57,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712709858] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:55:57,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670933840] [2022-12-13 16:55:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:57,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:55:57,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:55:57,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:55:57,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 16:55:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:57,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:55:57,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:55:57,332 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 16:55:57,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:55:57,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670933840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:57,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:55:57,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 16:55:57,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060828612] [2022-12-13 16:55:57,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:57,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:55:57,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:57,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:55:57,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:55:57,333 INFO L87 Difference]: Start difference. First operand 6203 states and 8073 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 16:55:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:57,982 INFO L93 Difference]: Finished difference Result 9369 states and 12759 transitions. [2022-12-13 16:55:57,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:55:57,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2022-12-13 16:55:57,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:57,993 INFO L225 Difference]: With dead ends: 9369 [2022-12-13 16:55:57,993 INFO L226 Difference]: Without dead ends: 6733 [2022-12-13 16:55:57,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:55:57,998 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 142 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:57,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 783 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:55:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2022-12-13 16:55:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 6733. [2022-12-13 16:55:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6733 states, 5425 states have (on average 1.3133640552995391) internal successors, (7125), 5522 states have internal predecessors, (7125), 690 states have call successors, (690), 499 states have call predecessors, (690), 616 states have return successors, (1016), 721 states have call predecessors, (1016), 687 states have call successors, (1016) [2022-12-13 16:55:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 8831 transitions. [2022-12-13 16:55:58,590 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 8831 transitions. Word has length 111 [2022-12-13 16:55:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:58,590 INFO L495 AbstractCegarLoop]: Abstraction has 6733 states and 8831 transitions. [2022-12-13 16:55:58,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 16:55:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 8831 transitions. [2022-12-13 16:55:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-13 16:55:58,595 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:58,595 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, 1] [2022-12-13 16:55:58,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 16:55:58,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:55:58,797 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash -878802759, now seen corresponding path program 1 times [2022-12-13 16:55:58,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:58,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990227665] [2022-12-13 16:55:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:58,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:55:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:55:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:55:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:55:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:55:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 16:55:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:55:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 16:55:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 16:55:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:55:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:55:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 16:55:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 16:55:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-12-13 16:55:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-12-13 16:55:58,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:58,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990227665] [2022-12-13 16:55:58,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990227665] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:55:58,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302758360] [2022-12-13 16:55:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:58,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:55:58,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:55:58,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:55:58,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 16:55:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:59,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:55:59,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:55:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 16:55:59,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:55:59,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302758360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:59,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:55:59,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-12-13 16:55:59,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526269777] [2022-12-13 16:55:59,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:59,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:55:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:59,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:55:59,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:55:59,043 INFO L87 Difference]: Start difference. First operand 6733 states and 8831 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 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-12-13 16:55:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:59,499 INFO L93 Difference]: Finished difference Result 8412 states and 10844 transitions. [2022-12-13 16:55:59,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:55:59,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 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 145 [2022-12-13 16:55:59,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:59,509 INFO L225 Difference]: With dead ends: 8412 [2022-12-13 16:55:59,509 INFO L226 Difference]: Without dead ends: 5175 [2022-12-13 16:55:59,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:55:59,514 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 34 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1575 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-12-13 16:55:59,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1575 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:55:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5175 states. [2022-12-13 16:55:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5175 to 5052. [2022-12-13 16:55:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5052 states, 4186 states have (on average 1.3509316770186335) internal successors, (5655), 4244 states have internal predecessors, (5655), 482 states have call successors, (482), 316 states have call predecessors, (482), 382 states have return successors, (722), 499 states have call predecessors, (722), 479 states have call successors, (722) [2022-12-13 16:55:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5052 states to 5052 states and 6859 transitions. [2022-12-13 16:55:59,945 INFO L78 Accepts]: Start accepts. Automaton has 5052 states and 6859 transitions. Word has length 145 [2022-12-13 16:55:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:59,945 INFO L495 AbstractCegarLoop]: Abstraction has 5052 states and 6859 transitions. [2022-12-13 16:55:59,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 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-12-13 16:55:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 5052 states and 6859 transitions. [2022-12-13 16:55:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-13 16:55:59,949 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:59,949 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:59,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 16:56:00,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 16:56:00,150 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:00,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:00,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1647944136, now seen corresponding path program 1 times [2022-12-13 16:56:00,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:00,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208555337] [2022-12-13 16:56:00,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:00,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:00,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:00,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:00,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:00,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:00,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 16:56:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-12-13 16:56:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:00,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:00,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 16:56:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 16:56:00,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:00,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208555337] [2022-12-13 16:56:00,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208555337] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:00,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686868202] [2022-12-13 16:56:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:00,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:00,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:00,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:00,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 16:56:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:00,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:56:00,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 16:56:00,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:00,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686868202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:00,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:00,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 16:56:00,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741917410] [2022-12-13 16:56:00,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:00,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:56:00,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:00,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:56:00,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:00,421 INFO L87 Difference]: Start difference. First operand 5052 states and 6859 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:56:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:01,106 INFO L93 Difference]: Finished difference Result 11808 states and 16744 transitions. [2022-12-13 16:56:01,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:56:01,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2022-12-13 16:56:01,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:01,120 INFO L225 Difference]: With dead ends: 11808 [2022-12-13 16:56:01,120 INFO L226 Difference]: Without dead ends: 8335 [2022-12-13 16:56:01,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:01,127 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 235 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:01,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 501 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:56:01,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8335 states. [2022-12-13 16:56:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8335 to 8265. [2022-12-13 16:56:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8265 states, 6889 states have (on average 1.379445492814632) internal successors, (9503), 6990 states have internal predecessors, (9503), 774 states have call successors, (774), 506 states have call predecessors, (774), 600 states have return successors, (1166), 776 states have call predecessors, (1166), 771 states have call successors, (1166) [2022-12-13 16:56:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 11443 transitions. [2022-12-13 16:56:01,828 INFO L78 Accepts]: Start accepts. Automaton has 8265 states and 11443 transitions. Word has length 143 [2022-12-13 16:56:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:01,828 INFO L495 AbstractCegarLoop]: Abstraction has 8265 states and 11443 transitions. [2022-12-13 16:56:01,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:56:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8265 states and 11443 transitions. [2022-12-13 16:56:01,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-13 16:56:01,834 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:01,834 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:01,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 16:56:02,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 16:56:02,036 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1613614096, now seen corresponding path program 1 times [2022-12-13 16:56:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:02,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114935040] [2022-12-13 16:56:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:02,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:02,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:02,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 16:56:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:02,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:02,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 16:56:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:02,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 16:56:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 16:56:02,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:02,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114935040] [2022-12-13 16:56:02,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114935040] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:02,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276076246] [2022-12-13 16:56:02,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:02,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:02,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:02,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:02,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 16:56:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:02,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:56:02,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 16:56:02,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:02,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276076246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:02,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:02,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 16:56:02,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400416542] [2022-12-13 16:56:02,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:02,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:56:02,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:02,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:56:02,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:02,290 INFO L87 Difference]: Start difference. First operand 8265 states and 11443 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:56:03,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:03,371 INFO L93 Difference]: Finished difference Result 15601 states and 22203 transitions. [2022-12-13 16:56:03,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:56:03,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2022-12-13 16:56:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:03,390 INFO L225 Difference]: With dead ends: 15601 [2022-12-13 16:56:03,390 INFO L226 Difference]: Without dead ends: 11391 [2022-12-13 16:56:03,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:03,399 INFO L413 NwaCegarLoop]: 351 mSDtfsCounter, 236 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:03,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 521 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:56:03,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11391 states. [2022-12-13 16:56:04,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11391 to 11291. [2022-12-13 16:56:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11291 states, 9440 states have (on average 1.3933262711864407) internal successors, (13153), 9575 states have internal predecessors, (13153), 1050 states have call successors, (1050), 681 states have call predecessors, (1050), 799 states have return successors, (1561), 1042 states have call predecessors, (1561), 1047 states have call successors, (1561) [2022-12-13 16:56:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11291 states to 11291 states and 15764 transitions. [2022-12-13 16:56:04,331 INFO L78 Accepts]: Start accepts. Automaton has 11291 states and 15764 transitions. Word has length 143 [2022-12-13 16:56:04,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:04,332 INFO L495 AbstractCegarLoop]: Abstraction has 11291 states and 15764 transitions. [2022-12-13 16:56:04,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 16:56:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 11291 states and 15764 transitions. [2022-12-13 16:56:04,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-13 16:56:04,339 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:04,339 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, 1] [2022-12-13 16:56:04,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 16:56:04,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 16:56:04,541 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:04,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash 50370099, now seen corresponding path program 1 times [2022-12-13 16:56:04,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:04,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875142558] [2022-12-13 16:56:04,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:04,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:56:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:56:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:56:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:56:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:56:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 16:56:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 16:56:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 16:56:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 16:56:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:56:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:56:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 16:56:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 16:56:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 16:56:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-13 16:56:04,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:04,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875142558] [2022-12-13 16:56:04,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875142558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:04,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:56:04,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:56:04,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73548035] [2022-12-13 16:56:04,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:04,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:56:04,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:04,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:56:04,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:56:04,630 INFO L87 Difference]: Start difference. First operand 11291 states and 15764 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 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-12-13 16:56:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:05,932 INFO L93 Difference]: Finished difference Result 12574 states and 17284 transitions. [2022-12-13 16:56:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:56:05,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 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 159 [2022-12-13 16:56:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:05,952 INFO L225 Difference]: With dead ends: 12574 [2022-12-13 16:56:05,952 INFO L226 Difference]: Without dead ends: 11184 [2022-12-13 16:56:05,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:56:05,957 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 285 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:05,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1038 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:56:05,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11184 states. [2022-12-13 16:56:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11184 to 11038. [2022-12-13 16:56:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11038 states, 9238 states have (on average 1.3988958649058238) internal successors, (12923), 9373 states have internal predecessors, (12923), 1025 states have call successors, (1025), 660 states have call predecessors, (1025), 773 states have return successors, (1523), 1012 states have call predecessors, (1523), 1022 states have call successors, (1523) [2022-12-13 16:56:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11038 states to 11038 states and 15471 transitions. [2022-12-13 16:56:06,855 INFO L78 Accepts]: Start accepts. Automaton has 11038 states and 15471 transitions. Word has length 159 [2022-12-13 16:56:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:06,856 INFO L495 AbstractCegarLoop]: Abstraction has 11038 states and 15471 transitions. [2022-12-13 16:56:06,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 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-12-13 16:56:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 11038 states and 15471 transitions. [2022-12-13 16:56:06,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-13 16:56:06,863 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:06,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:06,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 16:56:06,864 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:06,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:06,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2115413199, now seen corresponding path program 1 times [2022-12-13 16:56:06,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:06,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268846345] [2022-12-13 16:56:06,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:06,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 16:56:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:56:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:56:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 16:56:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 16:56:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 16:56:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 16:56:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 16:56:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 16:56:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 16:56:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 16:56:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:06,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 16:56:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:07,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 16:56:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:07,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-12-13 16:56:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-12-13 16:56:07,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:07,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268846345] [2022-12-13 16:56:07,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268846345] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:07,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631279220] [2022-12-13 16:56:07,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:07,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:07,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:07,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:07,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 16:56:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:07,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 16:56:07,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-13 16:56:07,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:07,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631279220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:07,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:07,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-12-13 16:56:07,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133169678] [2022-12-13 16:56:07,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:07,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:56:07,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:07,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:56:07,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:56:07,185 INFO L87 Difference]: Start difference. First operand 11038 states and 15471 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:56:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:08,660 INFO L93 Difference]: Finished difference Result 13364 states and 18279 transitions. [2022-12-13 16:56:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:56:08,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2022-12-13 16:56:08,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:08,686 INFO L225 Difference]: With dead ends: 13364 [2022-12-13 16:56:08,687 INFO L226 Difference]: Without dead ends: 11954 [2022-12-13 16:56:08,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:56:08,693 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 180 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:08,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 533 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:56:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11954 states. [2022-12-13 16:56:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11954 to 11912. [2022-12-13 16:56:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11912 states, 9969 states have (on average 1.3802788644798876) internal successors, (13760), 10108 states have internal predecessors, (13760), 1095 states have call successors, (1095), 711 states have call predecessors, (1095), 846 states have return successors, (1634), 1100 states have call predecessors, (1634), 1092 states have call successors, (1634) [2022-12-13 16:56:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11912 states to 11912 states and 16489 transitions. [2022-12-13 16:56:09,692 INFO L78 Accepts]: Start accepts. Automaton has 11912 states and 16489 transitions. Word has length 162 [2022-12-13 16:56:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:09,692 INFO L495 AbstractCegarLoop]: Abstraction has 11912 states and 16489 transitions. [2022-12-13 16:56:09,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-12-13 16:56:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 11912 states and 16489 transitions. [2022-12-13 16:56:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-13 16:56:09,700 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:09,700 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:09,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 16:56:09,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:09,901 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:09,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:09,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1963717299, now seen corresponding path program 1 times [2022-12-13 16:56:09,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:09,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57268164] [2022-12-13 16:56:09,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:09,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:09,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:10,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:10,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:10,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 16:56:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:56:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:10,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:10,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:56:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:10,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:10,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 16:56:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-13 16:56:10,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:10,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57268164] [2022-12-13 16:56:10,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57268164] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:10,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985608792] [2022-12-13 16:56:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:10,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:10,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:10,034 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:10,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 16:56:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:10,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:56:10,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 16:56:10,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:10,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985608792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:10,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:10,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 16:56:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013803042] [2022-12-13 16:56:10,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:10,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:56:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:10,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:56:10,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:10,129 INFO L87 Difference]: Start difference. First operand 11912 states and 16489 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:56:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:11,284 INFO L93 Difference]: Finished difference Result 21811 states and 30766 transitions. [2022-12-13 16:56:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:56:11,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-12-13 16:56:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:11,308 INFO L225 Difference]: With dead ends: 21811 [2022-12-13 16:56:11,308 INFO L226 Difference]: Without dead ends: 12814 [2022-12-13 16:56:11,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:11,322 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 298 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:11,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 358 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:56:11,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12814 states. [2022-12-13 16:56:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12814 to 12439. [2022-12-13 16:56:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12439 states, 10492 states have (on average 1.3265345024780786) internal successors, (13918), 10611 states have internal predecessors, (13918), 1063 states have call successors, (1063), 754 states have call predecessors, (1063), 882 states have return successors, (1512), 1077 states have call predecessors, (1512), 1060 states have call successors, (1512) [2022-12-13 16:56:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12439 states to 12439 states and 16493 transitions. [2022-12-13 16:56:12,543 INFO L78 Accepts]: Start accepts. Automaton has 12439 states and 16493 transitions. Word has length 160 [2022-12-13 16:56:12,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:12,543 INFO L495 AbstractCegarLoop]: Abstraction has 12439 states and 16493 transitions. [2022-12-13 16:56:12,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:56:12,544 INFO L276 IsEmpty]: Start isEmpty. Operand 12439 states and 16493 transitions. [2022-12-13 16:56:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-13 16:56:12,552 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:12,552 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:12,557 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 16:56:12,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 16:56:12,755 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:12,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2001388946, now seen corresponding path program 1 times [2022-12-13 16:56:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:12,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710651309] [2022-12-13 16:56:12,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:12,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 16:56:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:56:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 16:56:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 16:56:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-13 16:56:12,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:12,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710651309] [2022-12-13 16:56:12,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710651309] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:12,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166548431] [2022-12-13 16:56:12,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:12,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:12,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:12,887 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:12,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 16:56:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:12,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:56:12,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 16:56:13,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:13,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166548431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:13,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:13,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 16:56:13,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726631092] [2022-12-13 16:56:13,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:13,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:56:13,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:13,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:56:13,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:13,057 INFO L87 Difference]: Start difference. First operand 12439 states and 16493 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:56:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:14,269 INFO L93 Difference]: Finished difference Result 21018 states and 28214 transitions. [2022-12-13 16:56:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:56:14,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-12-13 16:56:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:14,286 INFO L225 Difference]: With dead ends: 21018 [2022-12-13 16:56:14,286 INFO L226 Difference]: Without dead ends: 10780 [2022-12-13 16:56:14,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:14,296 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 253 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:14,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 351 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:56:14,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10780 states. [2022-12-13 16:56:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10780 to 10740. [2022-12-13 16:56:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10740 states, 9090 states have (on average 1.28987898789879) internal successors, (11725), 9175 states have internal predecessors, (11725), 871 states have call successors, (871), 661 states have call predecessors, (871), 777 states have return successors, (1226), 907 states have call predecessors, (1226), 868 states have call successors, (1226) [2022-12-13 16:56:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10740 states to 10740 states and 13822 transitions. [2022-12-13 16:56:15,356 INFO L78 Accepts]: Start accepts. Automaton has 10740 states and 13822 transitions. Word has length 160 [2022-12-13 16:56:15,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:15,356 INFO L495 AbstractCegarLoop]: Abstraction has 10740 states and 13822 transitions. [2022-12-13 16:56:15,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:56:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 10740 states and 13822 transitions. [2022-12-13 16:56:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-13 16:56:15,362 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:15,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:15,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 16:56:15,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:15,564 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:15,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash 453524583, now seen corresponding path program 1 times [2022-12-13 16:56:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:15,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965561261] [2022-12-13 16:56:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:15,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 16:56:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 16:56:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 16:56:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 16:56:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-13 16:56:15,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:15,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965561261] [2022-12-13 16:56:15,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965561261] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:15,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135352352] [2022-12-13 16:56:15,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:15,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:15,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:15,665 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:15,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 16:56:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:15,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:56:15,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 16:56:15,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:15,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135352352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:15,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:15,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 16:56:15,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107893666] [2022-12-13 16:56:15,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:15,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:56:15,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:15,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:56:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:15,758 INFO L87 Difference]: Start difference. First operand 10740 states and 13822 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 16:56:16,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:16,802 INFO L93 Difference]: Finished difference Result 19185 states and 25013 transitions. [2022-12-13 16:56:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:56:16,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 160 [2022-12-13 16:56:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:16,818 INFO L225 Difference]: With dead ends: 19185 [2022-12-13 16:56:16,818 INFO L226 Difference]: Without dead ends: 10646 [2022-12-13 16:56:16,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:16,830 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 278 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:16,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 504 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:56:16,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10646 states. [2022-12-13 16:56:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10646 to 10646. [2022-12-13 16:56:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10646 states, 8996 states have (on average 1.272009782125389) internal successors, (11443), 9081 states have internal predecessors, (11443), 871 states have call successors, (871), 661 states have call predecessors, (871), 777 states have return successors, (1226), 907 states have call predecessors, (1226), 868 states have call successors, (1226) [2022-12-13 16:56:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10646 states to 10646 states and 13540 transitions. [2022-12-13 16:56:17,909 INFO L78 Accepts]: Start accepts. Automaton has 10646 states and 13540 transitions. Word has length 160 [2022-12-13 16:56:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:17,909 INFO L495 AbstractCegarLoop]: Abstraction has 10646 states and 13540 transitions. [2022-12-13 16:56:17,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 16:56:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 10646 states and 13540 transitions. [2022-12-13 16:56:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 16:56:17,914 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:17,914 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:17,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 16:56:18,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-13 16:56:18,116 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:18,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:18,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1421882321, now seen corresponding path program 1 times [2022-12-13 16:56:18,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:18,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15678178] [2022-12-13 16:56:18,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 16:56:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 16:56:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 16:56:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 16:56:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,247 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-13 16:56:18,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:18,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15678178] [2022-12-13 16:56:18,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15678178] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:18,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645736213] [2022-12-13 16:56:18,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:18,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:18,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:18,249 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:18,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 16:56:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:18,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:56:18,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 16:56:18,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:18,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645736213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:18,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:18,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 16:56:18,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469352203] [2022-12-13 16:56:18,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:18,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:56:18,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:18,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:56:18,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:18,331 INFO L87 Difference]: Start difference. First operand 10646 states and 13540 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:56:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:20,009 INFO L93 Difference]: Finished difference Result 25956 states and 33661 transitions. [2022-12-13 16:56:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:56:20,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2022-12-13 16:56:20,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:20,036 INFO L225 Difference]: With dead ends: 25956 [2022-12-13 16:56:20,036 INFO L226 Difference]: Without dead ends: 17511 [2022-12-13 16:56:20,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:20,045 INFO L413 NwaCegarLoop]: 464 mSDtfsCounter, 149 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:20,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 777 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:56:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17511 states. [2022-12-13 16:56:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17511 to 17507. [2022-12-13 16:56:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17507 states, 14790 states have (on average 1.2752535496957405) internal successors, (18861), 14942 states have internal predecessors, (18861), 1461 states have call successors, (1461), 1084 states have call predecessors, (1461), 1254 states have return successors, (2233), 1488 states have call predecessors, (2233), 1458 states have call successors, (2233) [2022-12-13 16:56:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17507 states to 17507 states and 22555 transitions. [2022-12-13 16:56:21,784 INFO L78 Accepts]: Start accepts. Automaton has 17507 states and 22555 transitions. Word has length 161 [2022-12-13 16:56:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:21,784 INFO L495 AbstractCegarLoop]: Abstraction has 17507 states and 22555 transitions. [2022-12-13 16:56:21,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:56:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 17507 states and 22555 transitions. [2022-12-13 16:56:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 16:56:21,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:21,793 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:21,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 16:56:21,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:21,994 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:21,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:21,995 INFO L85 PathProgramCache]: Analyzing trace with hash -831857108, now seen corresponding path program 1 times [2022-12-13 16:56:21,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:21,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540518824] [2022-12-13 16:56:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:21,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 16:56:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 16:56:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 16:56:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 16:56:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-12-13 16:56:22,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:22,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540518824] [2022-12-13 16:56:22,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540518824] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:22,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045295727] [2022-12-13 16:56:22,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:22,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:22,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:22,098 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:22,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 16:56:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:22,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:56:22,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 16:56:22,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:22,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045295727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:22,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:22,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 16:56:22,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506800847] [2022-12-13 16:56:22,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:22,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:56:22,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:22,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:56:22,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:22,196 INFO L87 Difference]: Start difference. First operand 17507 states and 22555 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 16:56:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:25,270 INFO L93 Difference]: Finished difference Result 47490 states and 62539 transitions. [2022-12-13 16:56:25,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:56:25,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2022-12-13 16:56:25,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:25,332 INFO L225 Difference]: With dead ends: 47490 [2022-12-13 16:56:25,332 INFO L226 Difference]: Without dead ends: 32188 [2022-12-13 16:56:25,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:25,353 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 278 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:25,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 530 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:56:25,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32188 states. [2022-12-13 16:56:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32188 to 32004. [2022-12-13 16:56:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32004 states, 27074 states have (on average 1.2708133264386496) internal successors, (34406), 27360 states have internal predecessors, (34406), 2659 states have call successors, (2659), 1984 states have call predecessors, (2659), 2269 states have return successors, (5013), 2675 states have call predecessors, (5013), 2656 states have call successors, (5013) [2022-12-13 16:56:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32004 states to 32004 states and 42078 transitions. [2022-12-13 16:56:28,898 INFO L78 Accepts]: Start accepts. Automaton has 32004 states and 42078 transitions. Word has length 161 [2022-12-13 16:56:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:28,898 INFO L495 AbstractCegarLoop]: Abstraction has 32004 states and 42078 transitions. [2022-12-13 16:56:28,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 16:56:28,899 INFO L276 IsEmpty]: Start isEmpty. Operand 32004 states and 42078 transitions. [2022-12-13 16:56:28,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 16:56:28,916 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:28,916 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:28,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 16:56:29,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-13 16:56:29,118 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:29,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:29,119 INFO L85 PathProgramCache]: Analyzing trace with hash 60308522, now seen corresponding path program 1 times [2022-12-13 16:56:29,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:29,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091157007] [2022-12-13 16:56:29,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:29,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:29,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:29,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:29,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:29,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:29,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 16:56:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:29,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 16:56:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:29,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:29,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 16:56:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:29,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:29,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 16:56:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-12-13 16:56:29,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:29,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091157007] [2022-12-13 16:56:29,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091157007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:29,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:56:29,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:56:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325537241] [2022-12-13 16:56:29,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:29,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:56:29,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:29,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:56:29,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:56:29,178 INFO L87 Difference]: Start difference. First operand 32004 states and 42078 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 16:56:32,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:32,744 INFO L93 Difference]: Finished difference Result 58974 states and 77653 transitions. [2022-12-13 16:56:32,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:56:32,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2022-12-13 16:56:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:32,802 INFO L225 Difference]: With dead ends: 58974 [2022-12-13 16:56:32,802 INFO L226 Difference]: Without dead ends: 29173 [2022-12-13 16:56:32,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:56:32,839 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 426 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:32,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 513 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:56:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29173 states. [2022-12-13 16:56:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29173 to 26979. [2022-12-13 16:56:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26979 states, 22783 states have (on average 1.2722644076723872) internal successors, (28986), 23235 states have internal predecessors, (28986), 2071 states have call successors, (2071), 1542 states have call predecessors, (2071), 2123 states have return successors, (4294), 2209 states have call predecessors, (4294), 2068 states have call successors, (4294) [2022-12-13 16:56:35,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26979 states to 26979 states and 35351 transitions. [2022-12-13 16:56:35,813 INFO L78 Accepts]: Start accepts. Automaton has 26979 states and 35351 transitions. Word has length 161 [2022-12-13 16:56:35,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:35,813 INFO L495 AbstractCegarLoop]: Abstraction has 26979 states and 35351 transitions. [2022-12-13 16:56:35,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 16:56:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 26979 states and 35351 transitions. [2022-12-13 16:56:35,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 16:56:35,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:35,827 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:35,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 16:56:35,827 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:35,827 INFO L85 PathProgramCache]: Analyzing trace with hash -81101080, now seen corresponding path program 1 times [2022-12-13 16:56:35,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:35,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369199928] [2022-12-13 16:56:35,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:35,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:56:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 16:56:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 16:56:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 16:56:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 16:56:35,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:35,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369199928] [2022-12-13 16:56:35,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369199928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:35,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453181642] [2022-12-13 16:56:35,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:35,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:35,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:35,908 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:35,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 16:56:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:35,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:56:35,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 16:56:35,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:35,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453181642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:35,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:35,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 16:56:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61811698] [2022-12-13 16:56:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:35,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:56:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:36,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:56:36,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:36,000 INFO L87 Difference]: Start difference. First operand 26979 states and 35351 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:56:38,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:38,822 INFO L93 Difference]: Finished difference Result 44846 states and 61259 transitions. [2022-12-13 16:56:38,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:56:38,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-12-13 16:56:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:38,875 INFO L225 Difference]: With dead ends: 44846 [2022-12-13 16:56:38,876 INFO L226 Difference]: Without dead ends: 27045 [2022-12-13 16:56:38,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:38,905 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 138 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:38,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 713 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:56:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27045 states. [2022-12-13 16:56:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27045 to 26979. [2022-12-13 16:56:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26979 states, 22783 states have (on average 1.2479919238028354) internal successors, (28433), 23235 states have internal predecessors, (28433), 2071 states have call successors, (2071), 1542 states have call predecessors, (2071), 2123 states have return successors, (4294), 2209 states have call predecessors, (4294), 2068 states have call successors, (4294) [2022-12-13 16:56:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26979 states to 26979 states and 34798 transitions. [2022-12-13 16:56:42,171 INFO L78 Accepts]: Start accepts. Automaton has 26979 states and 34798 transitions. Word has length 163 [2022-12-13 16:56:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:42,171 INFO L495 AbstractCegarLoop]: Abstraction has 26979 states and 34798 transitions. [2022-12-13 16:56:42,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 16:56:42,172 INFO L276 IsEmpty]: Start isEmpty. Operand 26979 states and 34798 transitions. [2022-12-13 16:56:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 16:56:42,186 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:42,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:42,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 16:56:42,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 16:56:42,386 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:42,386 INFO L85 PathProgramCache]: Analyzing trace with hash -929152312, now seen corresponding path program 1 times [2022-12-13 16:56:42,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:42,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829931316] [2022-12-13 16:56:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:42,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:56:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 16:56:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 16:56:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 16:56:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 16:56:42,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:42,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829931316] [2022-12-13 16:56:42,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829931316] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:42,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604843732] [2022-12-13 16:56:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:42,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:42,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:42,469 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:42,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 16:56:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:42,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:56:42,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 16:56:42,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:42,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604843732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:42,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:42,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 16:56:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437643887] [2022-12-13 16:56:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:42,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:56:42,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:42,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:56:42,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:42,594 INFO L87 Difference]: Start difference. First operand 26979 states and 34798 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:56:45,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:45,573 INFO L93 Difference]: Finished difference Result 48806 states and 65023 transitions. [2022-12-13 16:56:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:56:45,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2022-12-13 16:56:45,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:45,622 INFO L225 Difference]: With dead ends: 48806 [2022-12-13 16:56:45,622 INFO L226 Difference]: Without dead ends: 26524 [2022-12-13 16:56:45,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:56:45,649 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 265 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:45,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 344 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:56:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26524 states. [2022-12-13 16:56:47,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26524 to 18133. [2022-12-13 16:56:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18133 states, 15366 states have (on average 1.2041520239489782) internal successors, (18503), 15648 states have internal predecessors, (18503), 1353 states have call successors, (1353), 1032 states have call predecessors, (1353), 1412 states have return successors, (2496), 1456 states have call predecessors, (2496), 1350 states have call successors, (2496) [2022-12-13 16:56:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18133 states to 18133 states and 22352 transitions. [2022-12-13 16:56:47,965 INFO L78 Accepts]: Start accepts. Automaton has 18133 states and 22352 transitions. Word has length 163 [2022-12-13 16:56:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:47,966 INFO L495 AbstractCegarLoop]: Abstraction has 18133 states and 22352 transitions. [2022-12-13 16:56:47,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 16:56:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 18133 states and 22352 transitions. [2022-12-13 16:56:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 16:56:47,974 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:47,974 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:47,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 16:56:48,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:48,176 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:48,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:48,177 INFO L85 PathProgramCache]: Analyzing trace with hash 282552368, now seen corresponding path program 1 times [2022-12-13 16:56:48,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:48,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459412835] [2022-12-13 16:56:48,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:56:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 16:56:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 16:56:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 16:56:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 16:56:48,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:48,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459412835] [2022-12-13 16:56:48,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459412835] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:48,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004114650] [2022-12-13 16:56:48,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:48,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:48,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:48,287 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:48,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 16:56:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:48,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:56:48,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:48,420 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 16:56:48,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:48,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004114650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:48,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:48,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 16:56:48,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510966966] [2022-12-13 16:56:48,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:48,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:56:48,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:48,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:56:48,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:56:48,422 INFO L87 Difference]: Start difference. First operand 18133 states and 22352 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 16:56:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:50,818 INFO L93 Difference]: Finished difference Result 34065 states and 42439 transitions. [2022-12-13 16:56:50,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:56:50,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 16:56:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:50,849 INFO L225 Difference]: With dead ends: 34065 [2022-12-13 16:56:50,849 INFO L226 Difference]: Without dead ends: 18133 [2022-12-13 16:56:50,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:56:50,871 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 352 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:50,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 476 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:56:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18133 states. [2022-12-13 16:56:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18133 to 18133. [2022-12-13 16:56:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18133 states, 15366 states have (on average 1.1799427307041521) internal successors, (18131), 15648 states have internal predecessors, (18131), 1353 states have call successors, (1353), 1032 states have call predecessors, (1353), 1412 states have return successors, (2496), 1456 states have call predecessors, (2496), 1350 states have call successors, (2496) [2022-12-13 16:56:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18133 states to 18133 states and 21980 transitions. [2022-12-13 16:56:53,167 INFO L78 Accepts]: Start accepts. Automaton has 18133 states and 21980 transitions. Word has length 165 [2022-12-13 16:56:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:53,167 INFO L495 AbstractCegarLoop]: Abstraction has 18133 states and 21980 transitions. [2022-12-13 16:56:53,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 16:56:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 18133 states and 21980 transitions. [2022-12-13 16:56:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 16:56:53,174 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:53,174 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:53,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 16:56:53,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:53,376 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:53,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:53,377 INFO L85 PathProgramCache]: Analyzing trace with hash -810082834, now seen corresponding path program 1 times [2022-12-13 16:56:53,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:53,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430595301] [2022-12-13 16:56:53,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:56:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 16:56:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 16:56:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 16:56:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 16:56:53,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:53,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430595301] [2022-12-13 16:56:53,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430595301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:53,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494482774] [2022-12-13 16:56:53,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:53,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:53,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:53,464 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:53,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 16:56:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:53,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:56:53,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 16:56:53,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:53,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494482774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:53,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:53,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 16:56:53,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845406778] [2022-12-13 16:56:53,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:53,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:56:53,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:53,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:56:53,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:56:53,616 INFO L87 Difference]: Start difference. First operand 18133 states and 21980 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 16:56:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:55,735 INFO L93 Difference]: Finished difference Result 27073 states and 33157 transitions. [2022-12-13 16:56:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:56:55,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 16:56:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:55,760 INFO L225 Difference]: With dead ends: 27073 [2022-12-13 16:56:55,760 INFO L226 Difference]: Without dead ends: 15711 [2022-12-13 16:56:55,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:56:55,773 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 348 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:55,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 469 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:56:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15711 states. [2022-12-13 16:56:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15711 to 12330. [2022-12-13 16:56:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12330 states, 10442 states have (on average 1.1630913618080827) internal successors, (12145), 10615 states have internal predecessors, (12145), 935 states have call successors, (935), 702 states have call predecessors, (935), 951 states have return successors, (1680), 1014 states have call predecessors, (1680), 932 states have call successors, (1680) [2022-12-13 16:56:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12330 states to 12330 states and 14760 transitions. [2022-12-13 16:56:57,503 INFO L78 Accepts]: Start accepts. Automaton has 12330 states and 14760 transitions. Word has length 165 [2022-12-13 16:56:57,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:56:57,503 INFO L495 AbstractCegarLoop]: Abstraction has 12330 states and 14760 transitions. [2022-12-13 16:56:57,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 16:56:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 12330 states and 14760 transitions. [2022-12-13 16:56:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 16:56:57,507 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:56:57,508 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:56:57,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 16:56:57,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 16:56:57,709 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:56:57,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:56:57,710 INFO L85 PathProgramCache]: Analyzing trace with hash -322035728, now seen corresponding path program 1 times [2022-12-13 16:56:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:56:57,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95960626] [2022-12-13 16:56:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:57,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:56:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:56:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:56:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:56:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:56:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:56:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:56:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 16:56:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 16:56:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:56:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 16:56:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 16:56:57,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:56:57,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95960626] [2022-12-13 16:56:57,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95960626] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:56:57,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240958348] [2022-12-13 16:56:57,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:56:57,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:56:57,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:56:57,807 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:56:57,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 16:56:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:56:57,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:56:57,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 16:56:57,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:56:57,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240958348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:56:57,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:56:57,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 16:56:57,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899672614] [2022-12-13 16:56:57,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:56:57,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:56:57,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:56:57,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:56:57,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:56:57,920 INFO L87 Difference]: Start difference. First operand 12330 states and 14760 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 16:56:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:56:59,601 INFO L93 Difference]: Finished difference Result 22316 states and 27242 transitions. [2022-12-13 16:56:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:56:59,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 16:56:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:56:59,619 INFO L225 Difference]: With dead ends: 22316 [2022-12-13 16:56:59,620 INFO L226 Difference]: Without dead ends: 12189 [2022-12-13 16:56:59,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:56:59,630 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 49 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:56:59,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1234 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:56:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12189 states. [2022-12-13 16:57:01,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12189 to 11933. [2022-12-13 16:57:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11933 states, 10063 states have (on average 1.1470734373447282) internal successors, (11543), 10225 states have internal predecessors, (11543), 935 states have call successors, (935), 702 states have call predecessors, (935), 933 states have return successors, (1572), 1007 states have call predecessors, (1572), 932 states have call successors, (1572) [2022-12-13 16:57:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11933 states to 11933 states and 14050 transitions. [2022-12-13 16:57:01,292 INFO L78 Accepts]: Start accepts. Automaton has 11933 states and 14050 transitions. Word has length 165 [2022-12-13 16:57:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:57:01,292 INFO L495 AbstractCegarLoop]: Abstraction has 11933 states and 14050 transitions. [2022-12-13 16:57:01,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 16:57:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 11933 states and 14050 transitions. [2022-12-13 16:57:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 16:57:01,296 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:57:01,296 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:01,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 16:57:01,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 16:57:01,497 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:57:01,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash -490424150, now seen corresponding path program 1 times [2022-12-13 16:57:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:01,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032022502] [2022-12-13 16:57:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:01,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:57:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:57:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:57:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:57:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:57:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 16:57:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 16:57:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 16:57:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 16:57:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-13 16:57:01,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:01,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032022502] [2022-12-13 16:57:01,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032022502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:57:01,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508386476] [2022-12-13 16:57:01,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:01,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:57:01,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:57:01,615 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:57:01,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 16:57:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:01,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:57:01,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:57:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-13 16:57:01,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:57:01,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508386476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:01,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:57:01,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 16:57:01,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133241237] [2022-12-13 16:57:01,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:01,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:57:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:01,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:57:01,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:57:01,700 INFO L87 Difference]: Start difference. First operand 11933 states and 14050 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 16:57:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:57:03,123 INFO L93 Difference]: Finished difference Result 18276 states and 21782 transitions. [2022-12-13 16:57:03,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:57:03,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 16:57:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:57:03,137 INFO L225 Difference]: With dead ends: 18276 [2022-12-13 16:57:03,137 INFO L226 Difference]: Without dead ends: 8543 [2022-12-13 16:57:03,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:57:03,148 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 10 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:57:03,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1219 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:57:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8543 states. [2022-12-13 16:57:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8543 to 8507. [2022-12-13 16:57:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8507 states, 7210 states have (on average 1.1402219140083218) internal successors, (8221), 7284 states have internal predecessors, (8221), 664 states have call successors, (664), 502 states have call predecessors, (664), 631 states have return successors, (965), 721 states have call predecessors, (965), 661 states have call successors, (965) [2022-12-13 16:57:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8507 states to 8507 states and 9850 transitions. [2022-12-13 16:57:04,386 INFO L78 Accepts]: Start accepts. Automaton has 8507 states and 9850 transitions. Word has length 165 [2022-12-13 16:57:04,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:57:04,386 INFO L495 AbstractCegarLoop]: Abstraction has 8507 states and 9850 transitions. [2022-12-13 16:57:04,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 16:57:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 8507 states and 9850 transitions. [2022-12-13 16:57:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-12-13 16:57:04,390 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:57:04,390 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:04,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 16:57:04,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 16:57:04,591 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:57:04,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash 994864062, now seen corresponding path program 1 times [2022-12-13 16:57:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:04,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640930791] [2022-12-13 16:57:04,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:04,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:57:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:57:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:57:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:57:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:57:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 16:57:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 16:57:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 16:57:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-12-13 16:57:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 16:57:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-12-13 16:57:04,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:04,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640930791] [2022-12-13 16:57:04,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640930791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:57:04,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478569266] [2022-12-13 16:57:04,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:04,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:57:04,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:57:04,693 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:57:04,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 16:57:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:04,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:57:04,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:57:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 16:57:04,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:57:04,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478569266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:04,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:57:04,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 16:57:04,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324004159] [2022-12-13 16:57:04,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:04,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:57:04,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:04,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:57:04,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:57:04,779 INFO L87 Difference]: Start difference. First operand 8507 states and 9850 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 16:57:05,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:57:05,444 INFO L93 Difference]: Finished difference Result 10600 states and 12240 transitions. [2022-12-13 16:57:05,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:57:05,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 200 [2022-12-13 16:57:05,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:57:05,451 INFO L225 Difference]: With dead ends: 10600 [2022-12-13 16:57:05,451 INFO L226 Difference]: Without dead ends: 4221 [2022-12-13 16:57:05,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:57:05,458 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 135 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:57:05,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 667 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:57:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2022-12-13 16:57:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4221. [2022-12-13 16:57:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4221 states, 3526 states have (on average 1.136415201361316) internal successors, (4007), 3555 states have internal predecessors, (4007), 362 states have call successors, (362), 268 states have call predecessors, (362), 331 states have return successors, (464), 398 states have call predecessors, (464), 359 states have call successors, (464) [2022-12-13 16:57:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 4833 transitions. [2022-12-13 16:57:06,004 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 4833 transitions. Word has length 200 [2022-12-13 16:57:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:57:06,004 INFO L495 AbstractCegarLoop]: Abstraction has 4221 states and 4833 transitions. [2022-12-13 16:57:06,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 16:57:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 4833 transitions. [2022-12-13 16:57:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-12-13 16:57:06,006 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:57:06,007 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:06,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 16:57:06,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-12-13 16:57:06,208 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:57:06,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:06,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1498322473, now seen corresponding path program 1 times [2022-12-13 16:57:06,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:06,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970560341] [2022-12-13 16:57:06,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:06,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:57:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:57:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:57:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:57:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:57:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 16:57:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:57:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 16:57:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-12-13 16:57:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-12-13 16:57:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 53 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-12-13 16:57:06,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:06,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970560341] [2022-12-13 16:57:06,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970560341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:57:06,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160611861] [2022-12-13 16:57:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:06,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:57:06,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:57:06,311 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:57:06,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 16:57:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:06,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 16:57:06,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:57:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 16:57:06,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:57:06,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160611861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:06,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:57:06,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-12-13 16:57:06,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618903020] [2022-12-13 16:57:06,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:06,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:57:06,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:06,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:57:06,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:57:06,432 INFO L87 Difference]: Start difference. First operand 4221 states and 4833 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 16:57:06,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:57:06,945 INFO L93 Difference]: Finished difference Result 5724 states and 6542 transitions. [2022-12-13 16:57:06,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:57:06,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 201 [2022-12-13 16:57:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:57:06,951 INFO L225 Difference]: With dead ends: 5724 [2022-12-13 16:57:06,952 INFO L226 Difference]: Without dead ends: 4221 [2022-12-13 16:57:06,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:57:06,954 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 103 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:57:06,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 620 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:57:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2022-12-13 16:57:07,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4221. [2022-12-13 16:57:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4221 states, 3526 states have (on average 1.131310266591038) internal successors, (3989), 3555 states have internal predecessors, (3989), 362 states have call successors, (362), 268 states have call predecessors, (362), 331 states have return successors, (464), 398 states have call predecessors, (464), 359 states have call successors, (464) [2022-12-13 16:57:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 4815 transitions. [2022-12-13 16:57:07,479 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 4815 transitions. Word has length 201 [2022-12-13 16:57:07,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:57:07,479 INFO L495 AbstractCegarLoop]: Abstraction has 4221 states and 4815 transitions. [2022-12-13 16:57:07,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-12-13 16:57:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 4815 transitions. [2022-12-13 16:57:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-12-13 16:57:07,481 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:57:07,481 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:07,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 16:57:07,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:57:07,682 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:57:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1332935587, now seen corresponding path program 1 times [2022-12-13 16:57:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:07,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357723086] [2022-12-13 16:57:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:57:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:57:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:57:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:57:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:57:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 16:57:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:57:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 16:57:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 16:57:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 16:57:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-12-13 16:57:07,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:07,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357723086] [2022-12-13 16:57:07,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357723086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:07,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:07,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:57:07,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292089443] [2022-12-13 16:57:07,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:07,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:57:07,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:07,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:57:07,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:57:07,818 INFO L87 Difference]: Start difference. First operand 4221 states and 4815 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 16:57:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:57:09,228 INFO L93 Difference]: Finished difference Result 4499 states and 5108 transitions. [2022-12-13 16:57:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 16:57:09,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2022-12-13 16:57:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:57:09,234 INFO L225 Difference]: With dead ends: 4499 [2022-12-13 16:57:09,234 INFO L226 Difference]: Without dead ends: 4456 [2022-12-13 16:57:09,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-12-13 16:57:09,236 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 900 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:57:09,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1086 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 16:57:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2022-12-13 16:57:09,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 4152. [2022-12-13 16:57:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 3468 states have (on average 1.130334486735871) internal successors, (3920), 3497 states have internal predecessors, (3920), 355 states have call successors, (355), 263 states have call predecessors, (355), 327 states have return successors, (459), 392 states have call predecessors, (459), 353 states have call successors, (459) [2022-12-13 16:57:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 4734 transitions. [2022-12-13 16:57:09,790 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 4734 transitions. Word has length 203 [2022-12-13 16:57:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:57:09,791 INFO L495 AbstractCegarLoop]: Abstraction has 4152 states and 4734 transitions. [2022-12-13 16:57:09,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 16:57:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 4734 transitions. [2022-12-13 16:57:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-13 16:57:09,793 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:57:09,793 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:09,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 16:57:09,793 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:57:09,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:09,793 INFO L85 PathProgramCache]: Analyzing trace with hash 424573701, now seen corresponding path program 1 times [2022-12-13 16:57:09,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:09,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364563324] [2022-12-13 16:57:09,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:09,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 16:57:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 16:57:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 16:57:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 16:57:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 16:57:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 16:57:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 16:57:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 16:57:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 16:57:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 16:57:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 16:57:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-12-13 16:57:09,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:09,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364563324] [2022-12-13 16:57:09,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364563324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:09,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:09,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:57:09,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674146551] [2022-12-13 16:57:09,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:09,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:57:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:09,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:57:09,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:57:09,848 INFO L87 Difference]: Start difference. First operand 4152 states and 4734 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 16:57:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:57:10,777 INFO L93 Difference]: Finished difference Result 5472 states and 6267 transitions. [2022-12-13 16:57:10,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:57:10,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2022-12-13 16:57:10,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:57:10,784 INFO L225 Difference]: With dead ends: 5472 [2022-12-13 16:57:10,784 INFO L226 Difference]: Without dead ends: 4531 [2022-12-13 16:57:10,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:57:10,786 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 298 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:57:10,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 763 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:57:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2022-12-13 16:57:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4154. [2022-12-13 16:57:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4154 states, 3470 states have (on average 1.1302593659942364) internal successors, (3922), 3499 states have internal predecessors, (3922), 355 states have call successors, (355), 263 states have call predecessors, (355), 327 states have return successors, (459), 392 states have call predecessors, (459), 353 states have call successors, (459) [2022-12-13 16:57:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4154 states to 4154 states and 4736 transitions. [2022-12-13 16:57:11,362 INFO L78 Accepts]: Start accepts. Automaton has 4154 states and 4736 transitions. Word has length 207 [2022-12-13 16:57:11,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:57:11,363 INFO L495 AbstractCegarLoop]: Abstraction has 4154 states and 4736 transitions. [2022-12-13 16:57:11,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 16:57:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 4154 states and 4736 transitions. [2022-12-13 16:57:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-13 16:57:11,365 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:57:11,365 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:11,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 16:57:11,365 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:57:11,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:11,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1505939270, now seen corresponding path program 1 times [2022-12-13 16:57:11,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:11,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076864459] [2022-12-13 16:57:11,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:11,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:57:11,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:57:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:57:11,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:57:11,430 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:57:11,430 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 16:57:11,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 16:57:11,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 16:57:11,434 INFO L445 BasicCegarLoop]: Path program 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] [2022-12-13 16:57:11,437 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:57:11,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:57:11 BoogieIcfgContainer [2022-12-13 16:57:11,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:57:11,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:57:11,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:57:11,533 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:57:11,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:55:26" (3/4) ... [2022-12-13 16:57:11,535 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 16:57:11,614 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 16:57:11,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:57:11,615 INFO L158 Benchmark]: Toolchain (without parser) took 105466.89ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 107.8MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 706.9MB. Max. memory is 16.1GB. [2022-12-13 16:57:11,615 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:57:11,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.32ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 90.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 16:57:11,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.10ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 16:57:11,615 INFO L158 Benchmark]: Boogie Preprocessor took 25.91ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 84.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:57:11,615 INFO L158 Benchmark]: RCFGBuilder took 527.20ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 104.2MB in the end (delta: -19.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2022-12-13 16:57:11,615 INFO L158 Benchmark]: TraceAbstraction took 104544.89ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 103.8MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 678.5MB. Max. memory is 16.1GB. [2022-12-13 16:57:11,616 INFO L158 Benchmark]: Witness Printer took 81.05ms. Allocated memory is still 3.6GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-13 16:57:11,617 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.15ms. Allocated memory is still 102.8MB. Free memory is still 78.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.32ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 90.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.10ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.91ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 84.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.20ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 104.2MB in the end (delta: -19.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 104544.89ms. Allocated memory was 142.6MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 103.8MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 678.5MB. Max. memory is 16.1GB. * Witness Printer took 81.05ms. Allocated memory is still 3.6GB. Free memory was 2.9GB in the beginning and 2.9GB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L1099] COND FALSE !(__VERIFIER_nondet_int()) [L1102] CALL main2() [L1086] int __retres1 ; [L1090] CALL init_model2() [L1000] m_i = 1 [L1001] t1_i = 1 [L1002] t2_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1090] RET init_model2() [L1091] CALL start_simulation2() [L1027] int kernel_st ; [L1028] int tmp ; [L1029] int tmp___0 ; [L1033] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1034] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] CALL init_threads2() [L719] COND TRUE m_i == 1 [L720] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L724] COND TRUE t1_i == 1 [L725] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L729] COND TRUE t2_i == 1 [L730] t2_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1035] RET init_threads2() [L1036] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L832] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L837] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L847] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L852] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L857] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1036] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1037] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L654] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L664] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L673] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L683] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L685] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L692] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L702] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L704] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1037] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L870] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L880] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L885] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L890] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L895] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1038] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1041] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1044] kernel_st = 1 [L1045] CALL eval2() [L765] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L739] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L760] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp_ndt_2) [L798] t1_st = 1 [L799] CALL transmit1() [L582] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L593] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L595] t1_pc = 1 [L596] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L799] RET transmit1() [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE \read(tmp_ndt_3) [L812] t2_st = 1 [L813] CALL transmit2() [L618] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L629] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L631] t2_pc = 1 [L632] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L813] RET transmit2() [L769] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L772] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L739] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L760] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L772] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L537] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L540] token = __VERIFIER_nondet_int() [L541] local = token [L542] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L543] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L943] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L654] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L664] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L666] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L674] COND TRUE E_1 == 1 [L675] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L685] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND TRUE \read(tmp___0) [L922] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L693] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L702] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L704] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L943] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L543] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L544] E_1 = 2 [L545] m_pc = 1 [L546] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L785] RET master() [L793] COND TRUE t1_st == 0 [L794] int tmp_ndt_2; [L795] tmp_ndt_2 = __VERIFIER_nondet_int() [L796] COND TRUE \read(tmp_ndt_2) [L798] t1_st = 1 [L799] CALL transmit1() [L582] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L585] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L601] token += 1 [L602] E_2 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L603] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L943] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L654] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L655] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L664] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L666] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L674] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L683] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L685] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L693] COND TRUE E_2 == 1 [L694] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L704] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND TRUE \read(tmp___1) [L930] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L943] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L603] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L604] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L593] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L595] t1_pc = 1 [L596] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L799] RET transmit1() [L807] COND TRUE t2_st == 0 [L808] int tmp_ndt_3; [L809] tmp_ndt_3 = __VERIFIER_nondet_int() [L810] COND TRUE \read(tmp_ndt_3) [L812] t2_st = 1 [L813] CALL transmit2() [L618] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L621] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L637] token += 1 [L638] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L943] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L905] int tmp ; [L906] int tmp___0 ; [L907] int tmp___1 ; [L911] CALL, EXPR is_master_triggered() [L651] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L654] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L655] COND TRUE E_M == 1 [L656] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L666] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L911] RET, EXPR is_master_triggered() [L911] tmp = is_master_triggered() [L913] COND TRUE \read(tmp) [L914] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L919] CALL, EXPR is_transmit1_triggered() [L670] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L673] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L674] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L683] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L685] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L919] RET, EXPR is_transmit1_triggered() [L919] tmp___0 = is_transmit1_triggered() [L921] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L927] CALL, EXPR is_transmit2_triggered() [L689] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L692] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L693] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L702] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L704] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L927] RET, EXPR is_transmit2_triggered() [L927] tmp___1 = is_transmit2_triggered() [L929] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L943] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L639] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L640] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L629] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L631] t2_pc = 1 [L632] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L813] RET transmit2() [L769] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L772] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L739] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L742] COND TRUE m_st == 0 [L743] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L760] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L772] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L772] tmp = exists_runnable_thread2() [L774] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L779] COND TRUE m_st == 0 [L780] int tmp_ndt_1; [L781] tmp_ndt_1 = __VERIFIER_nondet_int() [L782] COND TRUE \read(tmp_ndt_1) [L784] m_st = 1 [L785] CALL master() [L524] int tmp_var = __VERIFIER_nondet_int(); [L526] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L529] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L551] COND FALSE !(token != local + 2) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L556] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L557] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L562] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L563] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L564] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L565] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L496] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 28]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 241 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 104.4s, OverallIterations: 45, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 55.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22135 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21639 mSDsluCounter, 36737 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24650 mSDsCounter, 3843 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21740 IncrementalHoareTripleChecker+Invalid, 25583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3843 mSolverCounterUnsat, 12087 mSDtfsCounter, 21740 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4438 GetRequests, 3948 SyntacticMatches, 6 SemanticMatches, 484 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32004occurred in iteration=33, InterpolantAutomatonStates: 414, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.5s AutomataMinimizationTime, 44 MinimizatonAttempts, 21983 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 8344 NumberOfCodeBlocks, 8344 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 8146 ConstructedInterpolants, 0 QuantifiedInterpolants, 15180 SizeOfPredicates, 9 NumberOfNonLiveVariables, 10191 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 64 InterpolantComputations, 43 PerfectInterpolantSequences, 3836/4182 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 16:57:11,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e661f375-348f-46d5-893c-c75384db2f3f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE