./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/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_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/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_9e234e98-1d7b-4c5d-9272-fdce156c2efe/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 e96a4dadf08c19b3d92d901d7f9116f0323f4fb1660ac2537112df0afe321751 --- 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 20:37:43,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:37:43,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:37:43,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:37:43,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:37:43,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:37:43,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:37:43,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:37:43,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:37:43,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:37:43,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:37:43,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:37:43,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:37:43,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:37:43,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:37:43,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:37:43,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:37:43,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:37:43,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:37:43,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:37:43,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:37:43,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:37:43,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:37:43,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:37:43,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:37:43,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:37:43,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:37:43,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:37:43,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:37:43,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:37:43,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:37:43,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:37:43,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:37:43,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:37:43,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:37:43,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:37:43,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:37:43,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:37:43,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:37:43,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:37:43,691 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:37:43,692 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 20:37:43,712 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:37:43,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:37:43,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:37:43,712 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:37:43,713 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:37:43,713 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:37:43,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:37:43,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:37:43,714 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:37:43,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:37:43,715 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:37:43,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:37:43,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:37:43,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:37:43,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:37:43,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:37:43,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:37:43,716 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:37:43,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:37:43,716 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:37:43,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:37:43,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:37:43,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:37:43,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:37:43,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:37:43,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:37:43,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:37:43,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:37:43,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:37:43,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:37:43,717 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:37:43,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:37:43,718 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:37:43,718 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:37:43,718 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:37:43,718 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_9e234e98-1d7b-4c5d-9272-fdce156c2efe/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_9e234e98-1d7b-4c5d-9272-fdce156c2efe/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 -> e96a4dadf08c19b3d92d901d7f9116f0323f4fb1660ac2537112df0afe321751 [2022-12-13 20:37:43,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:37:43,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:37:43,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:37:43,929 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:37:43,929 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:37:43,930 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2022-12-13 20:37:46,563 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:37:46,712 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:37:46,712 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2022-12-13 20:37:46,721 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/data/6ff5ac908/79b965fa987d4e349444792d42848068/FLAG95f616f54 [2022-12-13 20:37:46,733 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/data/6ff5ac908/79b965fa987d4e349444792d42848068 [2022-12-13 20:37:46,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:37:46,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:37:46,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:37:46,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:37:46,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:37:46,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:37:46" (1/1) ... [2022-12-13 20:37:46,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11f40872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:46, skipping insertion in model container [2022-12-13 20:37:46,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:37:46" (1/1) ... [2022-12-13 20:37:46,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:37:46,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:37:46,885 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_9e234e98-1d7b-4c5d-9272-fdce156c2efe/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[671,684] [2022-12-13 20:37:46,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:37:46,954 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:37:46,965 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_9e234e98-1d7b-4c5d-9272-fdce156c2efe/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[671,684] [2022-12-13 20:37:46,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:37:47,006 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:37:47,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47 WrapperNode [2022-12-13 20:37:47,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:37:47,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:37:47,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:37:47,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:37:47,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47" (1/1) ... [2022-12-13 20:37:47,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47" (1/1) ... [2022-12-13 20:37:47,044 INFO L138 Inliner]: procedures = 34, calls = 41, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 336 [2022-12-13 20:37:47,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:37:47,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:37:47,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:37:47,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:37:47,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47" (1/1) ... [2022-12-13 20:37:47,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47" (1/1) ... [2022-12-13 20:37:47,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47" (1/1) ... [2022-12-13 20:37:47,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47" (1/1) ... [2022-12-13 20:37:47,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47" (1/1) ... [2022-12-13 20:37:47,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47" (1/1) ... [2022-12-13 20:37:47,072 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47" (1/1) ... [2022-12-13 20:37:47,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47" (1/1) ... [2022-12-13 20:37:47,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:37:47,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:37:47,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:37:47,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:37:47,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47" (1/1) ... [2022-12-13 20:37:47,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:37:47,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:37:47,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:37:47,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:37:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:37:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-13 20:37:47,144 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-13 20:37:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 20:37:47,145 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 20:37:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 20:37:47,145 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 20:37:47,145 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 20:37:47,145 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 20:37:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 20:37:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 20:37:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 20:37:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 20:37:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:37:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 20:37:47,146 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 20:37:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:37:47,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:37:47,212 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:37:47,214 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:37:47,527 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:37:47,534 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:37:47,534 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 20:37:47,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:37:47 BoogieIcfgContainer [2022-12-13 20:37:47,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:37:47,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:37:47,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:37:47,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:37:47,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:37:46" (1/3) ... [2022-12-13 20:37:47,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fea691d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:37:47, skipping insertion in model container [2022-12-13 20:37:47,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:37:47" (2/3) ... [2022-12-13 20:37:47,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fea691d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:37:47, skipping insertion in model container [2022-12-13 20:37:47,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:37:47" (3/3) ... [2022-12-13 20:37:47,543 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2022-12-13 20:37:47,557 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:37:47,557 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 20:37:47,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:37:47,601 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;@4d2ab83d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:37:47,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 20:37:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 137 states have (on average 1.6058394160583942) internal successors, (220), 141 states have internal predecessors, (220), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-13 20:37:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 20:37:47,612 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:47,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:37:47,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:47,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1698734467, now seen corresponding path program 1 times [2022-12-13 20:37:47,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:47,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920458759] [2022-12-13 20:37:47,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:47,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:47,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:37:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:47,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:37:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:47,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:37:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:47,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:47,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:37:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:47,923 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 20:37:47,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:47,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920458759] [2022-12-13 20:37:47,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920458759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:47,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:37:47,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:37:47,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056341088] [2022-12-13 20:37:47,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:47,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:37:47,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:47,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:37:47,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:37:47,954 INFO L87 Difference]: Start difference. First operand has 165 states, 137 states have (on average 1.6058394160583942) internal successors, (220), 141 states have internal predecessors, (220), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 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 20:37:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:48,479 INFO L93 Difference]: Finished difference Result 363 states and 577 transitions. [2022-12-13 20:37:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:37:48,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 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 79 [2022-12-13 20:37:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:48,492 INFO L225 Difference]: With dead ends: 363 [2022-12-13 20:37:48,493 INFO L226 Difference]: Without dead ends: 202 [2022-12-13 20:37:48,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:37:48,500 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 375 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:48,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 341 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 20:37:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-12-13 20:37:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 159. [2022-12-13 20:37:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 133 states have (on average 1.5112781954887218) internal successors, (201), 135 states have internal predecessors, (201), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-12-13 20:37:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 237 transitions. [2022-12-13 20:37:48,544 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 237 transitions. Word has length 79 [2022-12-13 20:37:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:48,544 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 237 transitions. [2022-12-13 20:37:48,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 3 states have internal predecessors, (68), 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 20:37:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 237 transitions. [2022-12-13 20:37:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 20:37:48,546 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:48,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:37:48,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:37:48,547 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:48,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash -209723323, now seen corresponding path program 1 times [2022-12-13 20:37:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:48,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74646507] [2022-12-13 20:37:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:48,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:37:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:48,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:37:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:48,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:37:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:48,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:48,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:37:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:48,682 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 20:37:48,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:48,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74646507] [2022-12-13 20:37:48,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74646507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:48,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:37:48,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:37:48,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248536678] [2022-12-13 20:37:48,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:48,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:37:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:48,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:37:48,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:37:48,685 INFO L87 Difference]: Start difference. First operand 159 states and 237 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 20:37:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:49,504 INFO L93 Difference]: Finished difference Result 541 states and 828 transitions. [2022-12-13 20:37:49,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 20:37:49,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 79 [2022-12-13 20:37:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:49,508 INFO L225 Difference]: With dead ends: 541 [2022-12-13 20:37:49,508 INFO L226 Difference]: Without dead ends: 393 [2022-12-13 20:37:49,509 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 20:37:49,510 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 548 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:49,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 576 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 20:37:49,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-12-13 20:37:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 306. [2022-12-13 20:37:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 261 states have (on average 1.524904214559387) internal successors, (398), 264 states have internal predecessors, (398), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2022-12-13 20:37:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 461 transitions. [2022-12-13 20:37:49,553 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 461 transitions. Word has length 79 [2022-12-13 20:37:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:49,553 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 461 transitions. [2022-12-13 20:37:49,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 20:37:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 461 transitions. [2022-12-13 20:37:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 20:37:49,554 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:49,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:37:49,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:37:49,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:49,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:49,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1451163839, now seen corresponding path program 1 times [2022-12-13 20:37:49,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:49,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332394377] [2022-12-13 20:37:49,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:49,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:37:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:49,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:37:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:37:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:49,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:37:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:49,692 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 20:37:49,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:49,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332394377] [2022-12-13 20:37:49,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332394377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:49,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:37:49,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:37:49,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76800764] [2022-12-13 20:37:49,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:49,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:37:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:49,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:37:49,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:37:49,695 INFO L87 Difference]: Start difference. First operand 306 states and 461 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 20:37:50,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:50,547 INFO L93 Difference]: Finished difference Result 881 states and 1347 transitions. [2022-12-13 20:37:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 20:37:50,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 79 [2022-12-13 20:37:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:50,552 INFO L225 Difference]: With dead ends: 881 [2022-12-13 20:37:50,552 INFO L226 Difference]: Without dead ends: 586 [2022-12-13 20:37:50,554 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 20:37:50,554 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 551 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:50,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1052 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 20:37:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-12-13 20:37:50,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 445. [2022-12-13 20:37:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 381 states have (on average 1.5196850393700787) internal successors, (579), 385 states have internal predecessors, (579), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2022-12-13 20:37:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 668 transitions. [2022-12-13 20:37:50,585 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 668 transitions. Word has length 79 [2022-12-13 20:37:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:50,585 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 668 transitions. [2022-12-13 20:37:50,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 20:37:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 668 transitions. [2022-12-13 20:37:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 20:37:50,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:50,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:37:50,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:37:50,587 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:50,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:50,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1505556737, now seen corresponding path program 1 times [2022-12-13 20:37:50,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:50,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205745356] [2022-12-13 20:37:50,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:50,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:50,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:37:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:50,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:37:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:37:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:50,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:37:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:50,704 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 20:37:50,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:50,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205745356] [2022-12-13 20:37:50,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205745356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:50,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:37:50,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:37:50,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646490089] [2022-12-13 20:37:50,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:50,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:37:50,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:50,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:37:50,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:37:50,706 INFO L87 Difference]: Start difference. First operand 445 states and 668 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 20:37:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:51,529 INFO L93 Difference]: Finished difference Result 1379 states and 2102 transitions. [2022-12-13 20:37:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 20:37:51,530 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 79 [2022-12-13 20:37:51,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:51,535 INFO L225 Difference]: With dead ends: 1379 [2022-12-13 20:37:51,535 INFO L226 Difference]: Without dead ends: 945 [2022-12-13 20:37:51,537 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 20:37:51,538 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 546 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:51,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1050 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 20:37:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-12-13 20:37:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 726. [2022-12-13 20:37:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 624 states have (on average 1.516025641025641) internal successors, (946), 630 states have internal predecessors, (946), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2022-12-13 20:37:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1091 transitions. [2022-12-13 20:37:51,601 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1091 transitions. Word has length 79 [2022-12-13 20:37:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:51,601 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 1091 transitions. [2022-12-13 20:37:51,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 20:37:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1091 transitions. [2022-12-13 20:37:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 20:37:51,604 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:51,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:37:51,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:37:51,604 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:51,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:51,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1922953343, now seen corresponding path program 1 times [2022-12-13 20:37:51,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:51,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583881760] [2022-12-13 20:37:51,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:51,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:37:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:51,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:37:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:37:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:51,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:51,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:37:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:51,737 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 20:37:51,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:51,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583881760] [2022-12-13 20:37:51,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583881760] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:51,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:37:51,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:37:51,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800747573] [2022-12-13 20:37:51,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:51,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:37:51,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:51,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:37:51,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:37:51,739 INFO L87 Difference]: Start difference. First operand 726 states and 1091 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 20:37:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:52,777 INFO L93 Difference]: Finished difference Result 2554 states and 3875 transitions. [2022-12-13 20:37:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 20:37:52,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 79 [2022-12-13 20:37:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:52,783 INFO L225 Difference]: With dead ends: 2554 [2022-12-13 20:37:52,783 INFO L226 Difference]: Without dead ends: 1839 [2022-12-13 20:37:52,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 20:37:52,785 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 680 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:52,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1040 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 20:37:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2022-12-13 20:37:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1279. [2022-12-13 20:37:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1279 states, 1105 states have (on average 1.5167420814479637) internal successors, (1676), 1115 states have internal predecessors, (1676), 111 states have call successors, (111), 55 states have call predecessors, (111), 62 states have return successors, (144), 116 states have call predecessors, (144), 109 states have call successors, (144) [2022-12-13 20:37:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1931 transitions. [2022-12-13 20:37:52,852 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 1931 transitions. Word has length 79 [2022-12-13 20:37:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:52,852 INFO L495 AbstractCegarLoop]: Abstraction has 1279 states and 1931 transitions. [2022-12-13 20:37:52,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 20:37:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 1931 transitions. [2022-12-13 20:37:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 20:37:52,853 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:52,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:37:52,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:37:52,854 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:52,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:52,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1243681089, now seen corresponding path program 1 times [2022-12-13 20:37:52,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:52,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277284363] [2022-12-13 20:37:52,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:52,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:52,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:37:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:52,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:37:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:52,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:37:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:37:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:52,953 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 20:37:52,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:52,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277284363] [2022-12-13 20:37:52,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277284363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:52,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:37:52,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:37:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083382812] [2022-12-13 20:37:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:52,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:37:52,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:52,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:37:52,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:37:52,954 INFO L87 Difference]: Start difference. First operand 1279 states and 1931 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 20:37:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:54,138 INFO L93 Difference]: Finished difference Result 4569 states and 6941 transitions. [2022-12-13 20:37:54,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 20:37:54,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 79 [2022-12-13 20:37:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:54,153 INFO L225 Difference]: With dead ends: 4569 [2022-12-13 20:37:54,153 INFO L226 Difference]: Without dead ends: 3301 [2022-12-13 20:37:54,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 20:37:54,158 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 566 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:54,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1036 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 20:37:54,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2022-12-13 20:37:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 2300. [2022-12-13 20:37:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2300 states, 1986 states have (on average 1.5075528700906344) internal successors, (2994), 2004 states have internal predecessors, (2994), 195 states have call successors, (195), 103 states have call predecessors, (195), 118 states have return successors, (290), 208 states have call predecessors, (290), 193 states have call successors, (290) [2022-12-13 20:37:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 2300 states and 3479 transitions. [2022-12-13 20:37:54,292 INFO L78 Accepts]: Start accepts. Automaton has 2300 states and 3479 transitions. Word has length 79 [2022-12-13 20:37:54,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:54,292 INFO L495 AbstractCegarLoop]: Abstraction has 2300 states and 3479 transitions. [2022-12-13 20:37:54,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 20:37:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2300 states and 3479 transitions. [2022-12-13 20:37:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 20:37:54,294 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:54,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:37:54,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:37:54,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:54,295 INFO L85 PathProgramCache]: Analyzing trace with hash 717893569, now seen corresponding path program 1 times [2022-12-13 20:37:54,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:54,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098419942] [2022-12-13 20:37:54,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:54,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:54,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:37:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:37:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:54,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:37:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:54,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:54,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:37:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:54,384 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 20:37:54,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:54,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098419942] [2022-12-13 20:37:54,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098419942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:54,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:37:54,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:37:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124908411] [2022-12-13 20:37:54,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:54,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:37:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:54,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:37:54,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:37:54,385 INFO L87 Difference]: Start difference. First operand 2300 states and 3479 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 20:37:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:55,016 INFO L93 Difference]: Finished difference Result 5172 states and 7918 transitions. [2022-12-13 20:37:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:37:55,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 79 [2022-12-13 20:37:55,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:55,025 INFO L225 Difference]: With dead ends: 5172 [2022-12-13 20:37:55,025 INFO L226 Difference]: Without dead ends: 2883 [2022-12-13 20:37:55,029 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 20:37:55,030 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 418 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:55,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 517 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 20:37:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2022-12-13 20:37:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2300. [2022-12-13 20:37:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2300 states, 1986 states have (on average 1.498992950654582) internal successors, (2977), 2004 states have internal predecessors, (2977), 195 states have call successors, (195), 103 states have call predecessors, (195), 118 states have return successors, (290), 208 states have call predecessors, (290), 193 states have call successors, (290) [2022-12-13 20:37:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 2300 states and 3462 transitions. [2022-12-13 20:37:55,166 INFO L78 Accepts]: Start accepts. Automaton has 2300 states and 3462 transitions. Word has length 79 [2022-12-13 20:37:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:55,166 INFO L495 AbstractCegarLoop]: Abstraction has 2300 states and 3462 transitions. [2022-12-13 20:37:55,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 20:37:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2300 states and 3462 transitions. [2022-12-13 20:37:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 20:37:55,168 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:55,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:37:55,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:37:55,168 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:55,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:55,169 INFO L85 PathProgramCache]: Analyzing trace with hash 919717503, now seen corresponding path program 1 times [2022-12-13 20:37:55,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:55,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237402293] [2022-12-13 20:37:55,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:55,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:37:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:55,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:37:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:55,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:37:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:55,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:37:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:55,251 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 20:37:55,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:55,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237402293] [2022-12-13 20:37:55,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237402293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:55,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:37:55,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:37:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530580837] [2022-12-13 20:37:55,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:55,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:37:55,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:37:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:37:55,253 INFO L87 Difference]: Start difference. First operand 2300 states and 3462 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 20:37:56,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:56,323 INFO L93 Difference]: Finished difference Result 7970 states and 12031 transitions. [2022-12-13 20:37:56,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 20:37:56,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 79 [2022-12-13 20:37:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:56,344 INFO L225 Difference]: With dead ends: 7970 [2022-12-13 20:37:56,344 INFO L226 Difference]: Without dead ends: 5681 [2022-12-13 20:37:56,351 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 20:37:56,351 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 551 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:56,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1040 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 20:37:56,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5681 states. [2022-12-13 20:37:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5681 to 4430. [2022-12-13 20:37:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4430 states, 3844 states have (on average 1.4997398543184184) internal successors, (5765), 3878 states have internal predecessors, (5765), 355 states have call successors, (355), 199 states have call predecessors, (355), 230 states have return successors, (628), 384 states have call predecessors, (628), 353 states have call successors, (628) [2022-12-13 20:37:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4430 states to 4430 states and 6748 transitions. [2022-12-13 20:37:56,675 INFO L78 Accepts]: Start accepts. Automaton has 4430 states and 6748 transitions. Word has length 79 [2022-12-13 20:37:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:56,675 INFO L495 AbstractCegarLoop]: Abstraction has 4430 states and 6748 transitions. [2022-12-13 20:37:56,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 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 20:37:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 4430 states and 6748 transitions. [2022-12-13 20:37:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 20:37:56,679 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:56,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:37:56,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:37:56,679 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:56,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1480417281, now seen corresponding path program 1 times [2022-12-13 20:37:56,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:56,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192581327] [2022-12-13 20:37:56,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:56,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:56,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:37:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:56,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:37:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:56,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:37:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:56,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:56,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:37:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:56,762 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 20:37:56,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:56,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192581327] [2022-12-13 20:37:56,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192581327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:56,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:37:56,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:37:56,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667077034] [2022-12-13 20:37:56,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:56,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:37:56,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:56,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:37:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:37:56,764 INFO L87 Difference]: Start difference. First operand 4430 states and 6748 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 20:37:58,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:58,072 INFO L93 Difference]: Finished difference Result 12534 states and 19060 transitions. [2022-12-13 20:37:58,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 20:37:58,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 79 [2022-12-13 20:37:58,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:58,106 INFO L225 Difference]: With dead ends: 12534 [2022-12-13 20:37:58,106 INFO L226 Difference]: Without dead ends: 8116 [2022-12-13 20:37:58,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 20:37:58,117 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 702 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 20:37:58,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 744 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 20:37:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8116 states. [2022-12-13 20:37:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8116 to 6625. [2022-12-13 20:37:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6625 states, 5732 states have (on average 1.482205163991626) internal successors, (8496), 5799 states have internal predecessors, (8496), 544 states have call successors, (544), 301 states have call predecessors, (544), 348 states have return successors, (899), 556 states have call predecessors, (899), 542 states have call successors, (899) [2022-12-13 20:37:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 9939 transitions. [2022-12-13 20:37:58,547 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 9939 transitions. Word has length 79 [2022-12-13 20:37:58,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:37:58,547 INFO L495 AbstractCegarLoop]: Abstraction has 6625 states and 9939 transitions. [2022-12-13 20:37:58,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 20:37:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 9939 transitions. [2022-12-13 20:37:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-13 20:37:58,557 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:37:58,558 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:37:58,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:37:58,558 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:37:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:37:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1253867763, now seen corresponding path program 1 times [2022-12-13 20:37:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:37:58,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703343344] [2022-12-13 20:37:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:58,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:37:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:58,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:37:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:58,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:37:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:58,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:37:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:58,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:37:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:58,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:37:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:58,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 20:37:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:58,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:37:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:58,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 20:37:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 20:37:58,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:37:58,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703343344] [2022-12-13 20:37:58,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703343344] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:37:58,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592412344] [2022-12-13 20:37:58,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:37:58,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:37:58,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:37:58,681 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:37:58,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:37:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:37:58,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:37:58,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:37:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 20:37:58,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:37:58,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592412344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:37:58,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:37:58,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 20:37:58,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050211706] [2022-12-13 20:37:58,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:37:58,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:37:58,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:37:58,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:37:58,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:37:58,825 INFO L87 Difference]: Start difference. First operand 6625 states and 9939 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 20:37:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:37:59,554 INFO L93 Difference]: Finished difference Result 19672 states and 29707 transitions. [2022-12-13 20:37:59,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:37:59,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 128 [2022-12-13 20:37:59,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:37:59,601 INFO L225 Difference]: With dead ends: 19672 [2022-12-13 20:37:59,601 INFO L226 Difference]: Without dead ends: 13059 [2022-12-13 20:37:59,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 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 20:37:59,620 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 189 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 489 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 20:37:59,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 489 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:37:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13059 states. [2022-12-13 20:38:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13059 to 12955. [2022-12-13 20:38:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12955 states, 11202 states have (on average 1.4798250312444206) internal successors, (16577), 11334 states have internal predecessors, (16577), 1056 states have call successors, (1056), 601 states have call predecessors, (1056), 696 states have return successors, (1737), 1051 states have call predecessors, (1737), 1054 states have call successors, (1737) [2022-12-13 20:38:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12955 states to 12955 states and 19370 transitions. [2022-12-13 20:38:00,392 INFO L78 Accepts]: Start accepts. Automaton has 12955 states and 19370 transitions. Word has length 128 [2022-12-13 20:38:00,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:38:00,393 INFO L495 AbstractCegarLoop]: Abstraction has 12955 states and 19370 transitions. [2022-12-13 20:38:00,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 20:38:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 12955 states and 19370 transitions. [2022-12-13 20:38:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-13 20:38:00,414 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:38:00,414 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:38:00,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:38:00,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:38:00,615 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:38:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:38:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash 115435565, now seen corresponding path program 1 times [2022-12-13 20:38:00,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:38:00,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621932018] [2022-12-13 20:38:00,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:00,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:38:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:00,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:38:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:00,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:38:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:38:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:00,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:38:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:00,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:38:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:00,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 20:38:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:38:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:00,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 20:38:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 20:38:00,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:38:00,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621932018] [2022-12-13 20:38:00,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621932018] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:38:00,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033010527] [2022-12-13 20:38:00,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:00,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:38:00,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:38:00,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:38:00,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:38:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:00,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:38:00,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:38:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 20:38:00,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:38:00,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033010527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:38:00,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:38:00,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 20:38:00,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028263127] [2022-12-13 20:38:00,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:38:00,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:38:00,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:38:00,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:38:00,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:38:00,915 INFO L87 Difference]: Start difference. First operand 12955 states and 19370 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 20:38:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:38:02,235 INFO L93 Difference]: Finished difference Result 38484 states and 57932 transitions. [2022-12-13 20:38:02,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:38:02,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 128 [2022-12-13 20:38:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:38:02,294 INFO L225 Difference]: With dead ends: 38484 [2022-12-13 20:38:02,294 INFO L226 Difference]: Without dead ends: 25541 [2022-12-13 20:38:02,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 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 20:38:02,317 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 183 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 453 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 20:38:02,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 453 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:38:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25541 states. [2022-12-13 20:38:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25541 to 25337. [2022-12-13 20:38:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25337 states, 21890 states have (on average 1.4772498857925993) internal successors, (32337), 22152 states have internal predecessors, (32337), 2054 states have call successors, (2054), 1201 states have call predecessors, (2054), 1392 states have return successors, (3387), 2015 states have call predecessors, (3387), 2052 states have call successors, (3387) [2022-12-13 20:38:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25337 states to 25337 states and 37778 transitions. [2022-12-13 20:38:03,885 INFO L78 Accepts]: Start accepts. Automaton has 25337 states and 37778 transitions. Word has length 128 [2022-12-13 20:38:03,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:38:03,885 INFO L495 AbstractCegarLoop]: Abstraction has 25337 states and 37778 transitions. [2022-12-13 20:38:03,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 20:38:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 25337 states and 37778 transitions. [2022-12-13 20:38:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-12-13 20:38:03,908 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:38:03,908 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:38:03,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 20:38:04,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:38:04,109 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:38:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:38:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1158895283, now seen corresponding path program 1 times [2022-12-13 20:38:04,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:38:04,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791841348] [2022-12-13 20:38:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:38:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:04,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:38:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:04,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:38:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:04,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:38:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:04,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:38:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:04,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:38:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:04,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 20:38:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:04,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:38:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:04,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 20:38:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 20:38:04,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:38:04,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791841348] [2022-12-13 20:38:04,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791841348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:38:04,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585637872] [2022-12-13 20:38:04,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:04,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:38:04,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:38:04,224 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:38:04,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:38:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:04,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:38:04,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:38:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 20:38:04,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:38:04,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585637872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:38:04,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:38:04,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:38:04,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584063473] [2022-12-13 20:38:04,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:38:04,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:38:04,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:38:04,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:38:04,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:38:04,332 INFO L87 Difference]: Start difference. First operand 25337 states and 37778 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 20:38:07,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:38:07,065 INFO L93 Difference]: Finished difference Result 74632 states and 112417 transitions. [2022-12-13 20:38:07,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:38:07,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 128 [2022-12-13 20:38:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:38:07,208 INFO L225 Difference]: With dead ends: 74632 [2022-12-13 20:38:07,208 INFO L226 Difference]: Without dead ends: 49308 [2022-12-13 20:38:07,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 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 20:38:07,254 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 192 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 664 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 20:38:07,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 664 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:38:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49308 states. [2022-12-13 20:38:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49308 to 49308. [2022-12-13 20:38:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49308 states, 42554 states have (on average 1.4656906518776143) internal successors, (62371), 43009 states have internal predecessors, (62371), 3969 states have call successors, (3969), 2401 states have call predecessors, (3969), 2784 states have return successors, (7350), 3961 states have call predecessors, (7350), 3967 states have call successors, (7350) [2022-12-13 20:38:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49308 states to 49308 states and 73690 transitions. [2022-12-13 20:38:10,525 INFO L78 Accepts]: Start accepts. Automaton has 49308 states and 73690 transitions. Word has length 128 [2022-12-13 20:38:10,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:38:10,526 INFO L495 AbstractCegarLoop]: Abstraction has 49308 states and 73690 transitions. [2022-12-13 20:38:10,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 20:38:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 49308 states and 73690 transitions. [2022-12-13 20:38:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-12-13 20:38:10,612 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:38:10,612 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, 1, 1, 1, 1, 1, 1] [2022-12-13 20:38:10,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 20:38:10,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 20:38:10,813 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:38:10,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:38:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1361719287, now seen corresponding path program 1 times [2022-12-13 20:38:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:38:10,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138865087] [2022-12-13 20:38:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:38:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:10,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:38:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:10,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:38:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:10,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:38:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:10,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:38:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:10,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:38:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:10,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 20:38:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:10,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:38:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:10,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-12-13 20:38:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:10,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:38:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:10,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-12-13 20:38:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 20:38:10,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:38:10,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138865087] [2022-12-13 20:38:10,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138865087] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:38:10,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403033381] [2022-12-13 20:38:10,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:10,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:38:10,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:38:10,950 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:38:10,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:38:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:11,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:38:11,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:38:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 20:38:11,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:38:11,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403033381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:38:11,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:38:11,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 20:38:11,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120416716] [2022-12-13 20:38:11,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:38:11,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:38:11,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:38:11,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:38:11,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:38:11,188 INFO L87 Difference]: Start difference. First operand 49308 states and 73690 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 20:38:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:38:16,156 INFO L93 Difference]: Finished difference Result 145448 states and 218817 transitions. [2022-12-13 20:38:16,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:38:16,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 166 [2022-12-13 20:38:16,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:38:16,507 INFO L225 Difference]: With dead ends: 145448 [2022-12-13 20:38:16,508 INFO L226 Difference]: Without dead ends: 96158 [2022-12-13 20:38:16,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 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 20:38:16,633 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 139 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 456 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 20:38:16,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 456 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:38:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96158 states. [2022-12-13 20:38:22,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96158 to 95354. [2022-12-13 20:38:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95354 states, 82548 states have (on average 1.4655352037602365) internal successors, (120977), 83455 states have internal predecessors, (120977), 7383 states have call successors, (7383), 4655 states have call predecessors, (7383), 5422 states have return successors, (13774), 7307 states have call predecessors, (13774), 7381 states have call successors, (13774) [2022-12-13 20:38:22,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95354 states to 95354 states and 142134 transitions. [2022-12-13 20:38:22,274 INFO L78 Accepts]: Start accepts. Automaton has 95354 states and 142134 transitions. Word has length 166 [2022-12-13 20:38:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:38:22,274 INFO L495 AbstractCegarLoop]: Abstraction has 95354 states and 142134 transitions. [2022-12-13 20:38:22,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 20:38:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 95354 states and 142134 transitions. [2022-12-13 20:38:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-13 20:38:22,551 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:38:22,551 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:38:22,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 20:38:22,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 20:38:22,752 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:38:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:38:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash -912610153, now seen corresponding path program 1 times [2022-12-13 20:38:22,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:38:22,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398460820] [2022-12-13 20:38:22,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:22,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:38:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:38:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:38:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:38:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:38:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:38:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:38:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 20:38:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:38:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 20:38:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:38:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-12-13 20:38:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,872 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 20:38:22,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:38:22,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398460820] [2022-12-13 20:38:22,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398460820] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:38:22,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830774978] [2022-12-13 20:38:22,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:22,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:38:22,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:38:22,874 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:38:22,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 20:38:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:22,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:38:22,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:38:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 20:38:23,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:38:23,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830774978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:38:23,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:38:23,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:38:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360438302] [2022-12-13 20:38:23,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:38:23,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:38:23,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:38:23,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:38:23,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:38:23,042 INFO L87 Difference]: Start difference. First operand 95354 states and 142134 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (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 20:38:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:38:28,037 INFO L93 Difference]: Finished difference Result 147176 states and 219935 transitions. [2022-12-13 20:38:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:38:28,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (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 184 [2022-12-13 20:38:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:38:28,227 INFO L225 Difference]: With dead ends: 147176 [2022-12-13 20:38:28,227 INFO L226 Difference]: Without dead ends: 81322 [2022-12-13 20:38:28,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 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 20:38:28,325 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 160 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 274 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 20:38:28,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 274 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:38:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81322 states. [2022-12-13 20:38:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81322 to 57978. [2022-12-13 20:38:32,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57978 states, 50388 states have (on average 1.413927919345876) internal successors, (71245), 50851 states have internal predecessors, (71245), 4299 states have call successors, (4299), 2907 states have call predecessors, (4299), 3290 states have return successors, (6802), 4251 states have call predecessors, (6802), 4297 states have call successors, (6802) [2022-12-13 20:38:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57978 states to 57978 states and 82346 transitions. [2022-12-13 20:38:32,498 INFO L78 Accepts]: Start accepts. Automaton has 57978 states and 82346 transitions. Word has length 184 [2022-12-13 20:38:32,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:38:32,498 INFO L495 AbstractCegarLoop]: Abstraction has 57978 states and 82346 transitions. [2022-12-13 20:38:32,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (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 20:38:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 57978 states and 82346 transitions. [2022-12-13 20:38:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-13 20:38:32,573 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:38:32,573 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:38:32,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 20:38:32,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 20:38:32,773 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:38:32,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:38:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash -427827400, now seen corresponding path program 1 times [2022-12-13 20:38:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:38:32,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923606760] [2022-12-13 20:38:32,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:38:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:32,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:38:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:32,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:38:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:32,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:38:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:32,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:38:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:32,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:38:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:32,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:38:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:32,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 20:38:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:32,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:38:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:32,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 20:38:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:32,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:38:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:32,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-12-13 20:38:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-12-13 20:38:32,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:38:32,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923606760] [2022-12-13 20:38:32,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923606760] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:38:32,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200532142] [2022-12-13 20:38:32,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:32,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:38:32,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:38:33,000 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:38:33,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 20:38:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:33,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:38:33,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:38:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 20:38:33,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:38:33,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200532142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:38:33,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:38:33,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:38:33,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773271822] [2022-12-13 20:38:33,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:38:33,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:38:33,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:38:33,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:38:33,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:38:33,154 INFO L87 Difference]: Start difference. First operand 57978 states and 82346 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 20:38:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:38:38,006 INFO L93 Difference]: Finished difference Result 122570 states and 176133 transitions. [2022-12-13 20:38:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:38:38,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 184 [2022-12-13 20:38:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:38:38,141 INFO L225 Difference]: With dead ends: 122570 [2022-12-13 20:38:38,141 INFO L226 Difference]: Without dead ends: 64612 [2022-12-13 20:38:38,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 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 20:38:38,217 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 182 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 276 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 20:38:38,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:38:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64612 states. [2022-12-13 20:38:43,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64612 to 64440. [2022-12-13 20:38:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64440 states, 56406 states have (on average 1.3803318795872779) internal successors, (77859), 56869 states have internal predecessors, (77859), 4413 states have call successors, (4413), 3237 states have call predecessors, (4413), 3620 states have return successors, (7230), 4365 states have call predecessors, (7230), 4411 states have call successors, (7230) [2022-12-13 20:38:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64440 states to 64440 states and 89502 transitions. [2022-12-13 20:38:43,301 INFO L78 Accepts]: Start accepts. Automaton has 64440 states and 89502 transitions. Word has length 184 [2022-12-13 20:38:43,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:38:43,302 INFO L495 AbstractCegarLoop]: Abstraction has 64440 states and 89502 transitions. [2022-12-13 20:38:43,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 20:38:43,302 INFO L276 IsEmpty]: Start isEmpty. Operand 64440 states and 89502 transitions. [2022-12-13 20:38:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-12-13 20:38:43,386 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:38:43,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 20:38:43,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 20:38:43,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 20:38:43,588 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:38:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:38:43,589 INFO L85 PathProgramCache]: Analyzing trace with hash -525524426, now seen corresponding path program 1 times [2022-12-13 20:38:43,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:38:43,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462440969] [2022-12-13 20:38:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:43,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:38:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:38:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:38:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:38:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:38:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:38:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-12-13 20:38:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 20:38:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:38:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 20:38:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:38:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-12-13 20:38:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-12-13 20:38:43,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:38:43,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462440969] [2022-12-13 20:38:43,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462440969] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:38:43,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549251423] [2022-12-13 20:38:43,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:43,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:38:43,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:38:43,711 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:38:43,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 20:38:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:43,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:38:43,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:38:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-12-13 20:38:43,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:38:43,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549251423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:38:43,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:38:43,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:38:43,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198610262] [2022-12-13 20:38:43,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:38:43,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:38:43,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:38:43,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:38:43,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:38:43,857 INFO L87 Difference]: Start difference. First operand 64440 states and 89502 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, (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 20:38:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:38:49,284 INFO L93 Difference]: Finished difference Result 112661 states and 155942 transitions. [2022-12-13 20:38:49,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:38:49,285 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, (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 184 [2022-12-13 20:38:49,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:38:49,439 INFO L225 Difference]: With dead ends: 112661 [2022-12-13 20:38:49,440 INFO L226 Difference]: Without dead ends: 68468 [2022-12-13 20:38:49,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 205 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 20:38:49,510 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 158 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:38:49,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 466 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:38:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68468 states. [2022-12-13 20:38:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68468 to 68208. [2022-12-13 20:38:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68208 states, 59918 states have (on average 1.3576387729897526) internal successors, (81347), 60381 states have internal predecessors, (81347), 4457 states have call successors, (4457), 3433 states have call predecessors, (4457), 3832 states have return successors, (7486), 4425 states have call predecessors, (7486), 4455 states have call successors, (7486) [2022-12-13 20:38:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68208 states to 68208 states and 93290 transitions. [2022-12-13 20:38:55,347 INFO L78 Accepts]: Start accepts. Automaton has 68208 states and 93290 transitions. Word has length 184 [2022-12-13 20:38:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:38:55,348 INFO L495 AbstractCegarLoop]: Abstraction has 68208 states and 93290 transitions. [2022-12-13 20:38:55,348 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, (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 20:38:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 68208 states and 93290 transitions. [2022-12-13 20:38:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 20:38:55,431 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:38:55,432 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2022-12-13 20:38:55,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 20:38:55,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 20:38:55,633 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:38:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:38:55,634 INFO L85 PathProgramCache]: Analyzing trace with hash 306741357, now seen corresponding path program 1 times [2022-12-13 20:38:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:38:55,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571140868] [2022-12-13 20:38:55,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:55,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:38:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:38:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:38:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:38:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:38:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:38:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 20:38:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:38:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 20:38:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-12-13 20:38:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:38:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 20:38:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-12-13 20:38:55,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:38:55,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571140868] [2022-12-13 20:38:55,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571140868] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:38:55,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459049666] [2022-12-13 20:38:55,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:38:55,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:38:55,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:38:55,738 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:38:55,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 20:38:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:38:55,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:38:55,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:38:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 20:38:55,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:38:55,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459049666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:38:55,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:38:55,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:38:55,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119203121] [2022-12-13 20:38:55,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:38:55,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:38:55,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:38:55,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:38:55,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:38:55,841 INFO L87 Difference]: Start difference. First operand 68208 states and 93290 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 20:39:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:39:03,850 INFO L93 Difference]: Finished difference Result 136452 states and 188878 transitions. [2022-12-13 20:39:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:39:03,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 185 [2022-12-13 20:39:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:39:04,168 INFO L225 Difference]: With dead ends: 136452 [2022-12-13 20:39:04,168 INFO L226 Difference]: Without dead ends: 101404 [2022-12-13 20:39:04,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:39:04,227 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 182 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:39:04,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 653 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:39:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101404 states. [2022-12-13 20:39:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101404 to 101280. [2022-12-13 20:39:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101280 states, 89000 states have (on average 1.3548651685393258) internal successors, (120583), 89693 states have internal predecessors, (120583), 6561 states have call successors, (6561), 5089 states have call predecessors, (6561), 5718 states have return successors, (12690), 6529 states have call predecessors, (12690), 6559 states have call successors, (12690) [2022-12-13 20:39:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101280 states to 101280 states and 139834 transitions. [2022-12-13 20:39:12,736 INFO L78 Accepts]: Start accepts. Automaton has 101280 states and 139834 transitions. Word has length 185 [2022-12-13 20:39:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:39:12,736 INFO L495 AbstractCegarLoop]: Abstraction has 101280 states and 139834 transitions. [2022-12-13 20:39:12,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 20:39:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 101280 states and 139834 transitions. [2022-12-13 20:39:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 20:39:12,867 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:39:12,867 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:39:12,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 20:39:13,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 20:39:13,069 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:39:13,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1561905809, now seen corresponding path program 1 times [2022-12-13 20:39:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:13,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290500810] [2022-12-13 20:39:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:13,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:39:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:39:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:39:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:39:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:39:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 20:39:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:39:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 20:39:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 20:39:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:39:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 20:39:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 20:39:13,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:13,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290500810] [2022-12-13 20:39:13,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290500810] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:39:13,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806707214] [2022-12-13 20:39:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:13,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:13,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:39:13,184 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:39:13,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 20:39:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:13,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:39:13,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:39:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 20:39:13,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:39:13,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806707214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:39:13,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:39:13,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:39:13,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790239860] [2022-12-13 20:39:13,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:39:13,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:39:13,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:13,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:39:13,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:39:13,356 INFO L87 Difference]: Start difference. First operand 101280 states and 139834 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 20:39:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:39:21,151 INFO L93 Difference]: Finished difference Result 173420 states and 243173 transitions. [2022-12-13 20:39:21,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:39:21,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 185 [2022-12-13 20:39:21,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:39:21,359 INFO L225 Difference]: With dead ends: 173420 [2022-12-13 20:39:21,359 INFO L226 Difference]: Without dead ends: 91736 [2022-12-13 20:39:21,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:39:21,532 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 154 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 267 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 20:39:21,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 267 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:39:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91736 states. [2022-12-13 20:39:27,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91736 to 60864. [2022-12-13 20:39:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60864 states, 53594 states have (on average 1.320203754151584) internal successors, (70755), 53953 states have internal predecessors, (70755), 3865 states have call successors, (3865), 3073 states have call predecessors, (3865), 3404 states have return successors, (6718), 3853 states have call predecessors, (6718), 3863 states have call successors, (6718) [2022-12-13 20:39:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60864 states to 60864 states and 81338 transitions. [2022-12-13 20:39:27,772 INFO L78 Accepts]: Start accepts. Automaton has 60864 states and 81338 transitions. Word has length 185 [2022-12-13 20:39:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:39:27,772 INFO L495 AbstractCegarLoop]: Abstraction has 60864 states and 81338 transitions. [2022-12-13 20:39:27,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 20:39:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 60864 states and 81338 transitions. [2022-12-13 20:39:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 20:39:27,833 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:39:27,833 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:39:27,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 20:39:28,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 20:39:28,035 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:39:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:28,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1326881202, now seen corresponding path program 1 times [2022-12-13 20:39:28,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:28,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997543881] [2022-12-13 20:39:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:28,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:39:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:39:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:39:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:39:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:39:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 20:39:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:39:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 20:39:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 20:39:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:39:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 20:39:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 20:39:28,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:28,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997543881] [2022-12-13 20:39:28,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997543881] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:39:28,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422292769] [2022-12-13 20:39:28,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:28,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:28,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:39:28,155 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:39:28,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 20:39:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:28,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:39:28,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:39:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 20:39:28,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:39:28,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422292769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:39:28,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:39:28,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:39:28,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702047254] [2022-12-13 20:39:28,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:39:28,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:39:28,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:28,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:39:28,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:39:28,272 INFO L87 Difference]: Start difference. First operand 60864 states and 81338 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 20:39:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:39:38,820 INFO L93 Difference]: Finished difference Result 174888 states and 237224 transitions. [2022-12-13 20:39:38,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:39:38,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 185 [2022-12-13 20:39:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:39:39,097 INFO L225 Difference]: With dead ends: 174888 [2022-12-13 20:39:39,097 INFO L226 Difference]: Without dead ends: 114044 [2022-12-13 20:39:39,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:39:39,188 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 185 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 654 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 20:39:39,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 654 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:39:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114044 states. [2022-12-13 20:39:50,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114044 to 114040. [2022-12-13 20:39:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114040 states, 100208 states have (on average 1.315074644738943) internal successors, (131781), 100925 states have internal predecessors, (131781), 7375 states have call successors, (7375), 5793 states have call predecessors, (7375), 6456 states have return successors, (15670), 7353 states have call predecessors, (15670), 7373 states have call successors, (15670) [2022-12-13 20:39:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114040 states to 114040 states and 154826 transitions. [2022-12-13 20:39:50,467 INFO L78 Accepts]: Start accepts. Automaton has 114040 states and 154826 transitions. Word has length 185 [2022-12-13 20:39:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:39:50,467 INFO L495 AbstractCegarLoop]: Abstraction has 114040 states and 154826 transitions. [2022-12-13 20:39:50,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 20:39:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 114040 states and 154826 transitions. [2022-12-13 20:39:50,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 20:39:50,581 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:39:50,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2022-12-13 20:39:50,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 20:39:50,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:50,783 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:39:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:39:50,784 INFO L85 PathProgramCache]: Analyzing trace with hash 986787251, now seen corresponding path program 1 times [2022-12-13 20:39:50,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:39:50,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994799363] [2022-12-13 20:39:50,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:39:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:39:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:39:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:39:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:39:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:39:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 20:39:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:39:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 20:39:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 20:39:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:39:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 20:39:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-12-13 20:39:50,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:39:50,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994799363] [2022-12-13 20:39:50,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994799363] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:39:50,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930325885] [2022-12-13 20:39:50,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:39:50,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:39:50,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:39:50,913 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:39:50,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 20:39:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:39:50,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:39:50,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:39:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-13 20:39:51,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:39:51,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930325885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:39:51,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:39:51,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:39:51,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331724367] [2022-12-13 20:39:51,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:39:51,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:39:51,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:39:51,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:39:51,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:39:51,017 INFO L87 Difference]: Start difference. First operand 114040 states and 154826 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 20:40:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:10,776 INFO L93 Difference]: Finished difference Result 326076 states and 448064 transitions. [2022-12-13 20:40:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:40:10,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 185 [2022-12-13 20:40:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:11,404 INFO L225 Difference]: With dead ends: 326076 [2022-12-13 20:40:11,405 INFO L226 Difference]: Without dead ends: 212064 [2022-12-13 20:40:11,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:40:11,586 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 195 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 656 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 20:40:11,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 656 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:40:11,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212064 states. [2022-12-13 20:40:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212064 to 211884. [2022-12-13 20:40:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211884 states, 185784 states have (on average 1.3078790423287259) internal successors, (242983), 187217 states have internal predecessors, (242983), 14011 states have call successors, (14011), 10849 states have call predecessors, (14011), 12088 states have return successors, (33826), 13881 states have call predecessors, (33826), 14009 states have call successors, (33826) [2022-12-13 20:40:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211884 states to 211884 states and 290820 transitions. [2022-12-13 20:40:32,563 INFO L78 Accepts]: Start accepts. Automaton has 211884 states and 290820 transitions. Word has length 185 [2022-12-13 20:40:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:40:32,563 INFO L495 AbstractCegarLoop]: Abstraction has 211884 states and 290820 transitions. [2022-12-13 20:40:32,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 20:40:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 211884 states and 290820 transitions. [2022-12-13 20:40:32,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 20:40:32,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:40:32,866 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 20:40:32,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 20:40:33,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:33,067 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:40:33,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:40:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1030803176, now seen corresponding path program 1 times [2022-12-13 20:40:33,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:40:33,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894277901] [2022-12-13 20:40:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:40:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:40:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:40:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:40:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:40:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:40:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 20:40:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 20:40:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:40:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-12-13 20:40:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:40:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 20:40:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-13 20:40:33,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:40:33,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894277901] [2022-12-13 20:40:33,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894277901] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:40:33,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296155415] [2022-12-13 20:40:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:40:33,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:40:33,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:40:33,200 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:40:33,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 20:40:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:40:33,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:40:33,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:40:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-13 20:40:33,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:40:33,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296155415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:40:33,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:40:33,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:40:33,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236645185] [2022-12-13 20:40:33,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:40:33,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:40:33,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:40:33,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:40:33,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:40:33,330 INFO L87 Difference]: Start difference. First operand 211884 states and 290820 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 20:40:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:40:55,487 INFO L93 Difference]: Finished difference Result 385008 states and 529530 transitions. [2022-12-13 20:40:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:40:55,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 185 [2022-12-13 20:40:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:40:56,244 INFO L225 Difference]: With dead ends: 385008 [2022-12-13 20:40:56,244 INFO L226 Difference]: Without dead ends: 221728 [2022-12-13 20:40:56,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:40:56,548 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 177 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:40:56,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 504 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:40:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221728 states. [2022-12-13 20:41:17,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221728 to 211868. [2022-12-13 20:41:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211868 states, 185768 states have (on average 1.302221049911718) internal successors, (241911), 187201 states have internal predecessors, (241911), 14011 states have call successors, (14011), 10849 states have call predecessors, (14011), 12088 states have return successors, (33826), 13881 states have call predecessors, (33826), 14009 states have call successors, (33826) [2022-12-13 20:41:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211868 states to 211868 states and 289748 transitions. [2022-12-13 20:41:18,195 INFO L78 Accepts]: Start accepts. Automaton has 211868 states and 289748 transitions. Word has length 185 [2022-12-13 20:41:18,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:41:18,195 INFO L495 AbstractCegarLoop]: Abstraction has 211868 states and 289748 transitions. [2022-12-13 20:41:18,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 20:41:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 211868 states and 289748 transitions. [2022-12-13 20:41:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 20:41:18,372 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:41:18,372 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 20:41:18,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 20:41:18,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 20:41:18,574 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:41:18,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:41:18,575 INFO L85 PathProgramCache]: Analyzing trace with hash 202191312, now seen corresponding path program 1 times [2022-12-13 20:41:18,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:41:18,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49484449] [2022-12-13 20:41:18,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:41:18,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:41:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:41:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:41:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:41:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:41:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:41:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 20:41:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 20:41:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:41:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 20:41:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:41:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 20:41:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-13 20:41:18,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:41:18,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49484449] [2022-12-13 20:41:18,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49484449] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:41:18,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191302287] [2022-12-13 20:41:18,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:41:18,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:41:18,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:41:18,672 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:41:18,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 20:41:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:41:18,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:41:18,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:41:18,806 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-13 20:41:18,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:41:18,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191302287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:41:18,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:41:18,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:41:18,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078870466] [2022-12-13 20:41:18,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:41:18,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:41:18,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:41:18,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:41:18,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:41:18,807 INFO L87 Difference]: Start difference. First operand 211868 states and 289748 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 20:41:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:41:40,482 INFO L93 Difference]: Finished difference Result 429908 states and 589388 transitions. [2022-12-13 20:41:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:41:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 185 [2022-12-13 20:41:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:41:41,214 INFO L225 Difference]: With dead ends: 429908 [2022-12-13 20:41:41,215 INFO L226 Difference]: Without dead ends: 218088 [2022-12-13 20:41:41,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:41:41,535 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 180 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:41:41,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 461 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:41:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218088 states. [2022-12-13 20:42:03,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218088 to 211620. [2022-12-13 20:42:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211620 states, 185520 states have (on average 1.2952727468736525) internal successors, (240299), 186953 states have internal predecessors, (240299), 14011 states have call successors, (14011), 10849 states have call predecessors, (14011), 12088 states have return successors, (33826), 13881 states have call predecessors, (33826), 14009 states have call successors, (33826) [2022-12-13 20:42:03,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211620 states to 211620 states and 288136 transitions. [2022-12-13 20:42:03,990 INFO L78 Accepts]: Start accepts. Automaton has 211620 states and 288136 transitions. Word has length 185 [2022-12-13 20:42:03,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:42:03,991 INFO L495 AbstractCegarLoop]: Abstraction has 211620 states and 288136 transitions. [2022-12-13 20:42:03,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 20:42:03,991 INFO L276 IsEmpty]: Start isEmpty. Operand 211620 states and 288136 transitions. [2022-12-13 20:42:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-12-13 20:42:04,163 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:42:04,163 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 20:42:04,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 20:42:04,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:42:04,365 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:42:04,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:42:04,366 INFO L85 PathProgramCache]: Analyzing trace with hash -370552090, now seen corresponding path program 1 times [2022-12-13 20:42:04,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:42:04,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554102212] [2022-12-13 20:42:04,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:42:04,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:42:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:04,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:42:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:04,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:42:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:04,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:42:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:04,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:42:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:04,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:42:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:04,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 20:42:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:04,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 20:42:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:04,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:42:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:04,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-12-13 20:42:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:04,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:42:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:04,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 20:42:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-13 20:42:04,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:42:04,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554102212] [2022-12-13 20:42:04,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554102212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:42:04,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:42:04,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:42:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841113314] [2022-12-13 20:42:04,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:42:04,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:42:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:42:04,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:42:04,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:42:04,431 INFO L87 Difference]: Start difference. First operand 211620 states and 288136 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 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 20:42:28,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:42:28,670 INFO L93 Difference]: Finished difference Result 428850 states and 577105 transitions. [2022-12-13 20:42:28,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:42:28,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 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 185 [2022-12-13 20:42:28,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:42:29,230 INFO L225 Difference]: With dead ends: 428850 [2022-12-13 20:42:29,230 INFO L226 Difference]: Without dead ends: 217254 [2022-12-13 20:42:29,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:42:29,519 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 378 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 20:42:29,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 317 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 20:42:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217254 states. [2022-12-13 20:42:53,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217254 to 202246. [2022-12-13 20:42:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202246 states, 179054 states have (on average 1.2913255219095916) internal successors, (231217), 182233 states have internal predecessors, (231217), 10687 states have call successors, (10687), 8321 states have call predecessors, (10687), 12504 states have return successors, (28183), 11723 states have call predecessors, (28183), 10685 states have call successors, (28183) [2022-12-13 20:42:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202246 states to 202246 states and 270087 transitions. [2022-12-13 20:42:54,100 INFO L78 Accepts]: Start accepts. Automaton has 202246 states and 270087 transitions. Word has length 185 [2022-12-13 20:42:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:42:54,100 INFO L495 AbstractCegarLoop]: Abstraction has 202246 states and 270087 transitions. [2022-12-13 20:42:54,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 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 20:42:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 202246 states and 270087 transitions. [2022-12-13 20:42:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-13 20:42:54,232 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:42:54,232 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 20:42:54,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 20:42:54,233 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:42:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:42:54,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1790903288, now seen corresponding path program 1 times [2022-12-13 20:42:54,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:42:54,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506879527] [2022-12-13 20:42:54,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:42:54,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:42:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:42:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:42:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:42:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:42:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:42:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 20:42:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 20:42:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:42:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-12-13 20:42:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:42:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-12-13 20:42:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-13 20:42:54,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:42:54,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506879527] [2022-12-13 20:42:54,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506879527] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:42:54,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631607333] [2022-12-13 20:42:54,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:42:54,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:42:54,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:42:54,334 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:42:54,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 20:42:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:42:54,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:42:54,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:42:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 20:42:54,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:42:54,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631607333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:42:54,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:42:54,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:42:54,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126018032] [2022-12-13 20:42:54,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:42:54,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:42:54,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:42:54,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:42:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:42:54,445 INFO L87 Difference]: Start difference. First operand 202246 states and 270087 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 20:43:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:43:17,681 INFO L93 Difference]: Finished difference Result 359180 states and 479063 transitions. [2022-12-13 20:43:17,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:43:17,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 187 [2022-12-13 20:43:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:43:18,315 INFO L225 Difference]: With dead ends: 359180 [2022-12-13 20:43:18,315 INFO L226 Difference]: Without dead ends: 204098 [2022-12-13 20:43:18,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 208 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 20:43:18,515 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 183 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:43:18,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 483 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:43:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204098 states. [2022-12-13 20:43:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204098 to 202246. [2022-12-13 20:43:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202246 states, 179054 states have (on average 1.2880751058339943) internal successors, (230635), 182233 states have internal predecessors, (230635), 10687 states have call successors, (10687), 8321 states have call predecessors, (10687), 12504 states have return successors, (28183), 11723 states have call predecessors, (28183), 10685 states have call successors, (28183) [2022-12-13 20:43:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202246 states to 202246 states and 269505 transitions. [2022-12-13 20:43:42,413 INFO L78 Accepts]: Start accepts. Automaton has 202246 states and 269505 transitions. Word has length 187 [2022-12-13 20:43:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:43:42,413 INFO L495 AbstractCegarLoop]: Abstraction has 202246 states and 269505 transitions. [2022-12-13 20:43:42,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 20:43:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 202246 states and 269505 transitions. [2022-12-13 20:43:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-12-13 20:43:42,547 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:43:42,547 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 20:43:42,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 20:43:42,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:43:42,749 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:43:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:43:42,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1976796792, now seen corresponding path program 1 times [2022-12-13 20:43:42,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:43:42,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289630462] [2022-12-13 20:43:42,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:43:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:43:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:43:42,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:43:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:43:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:43:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:43:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:43:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:43:42,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:43:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:43:42,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:43:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:43:42,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 20:43:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:43:42,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 20:43:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:43:42,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:43:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:43:42,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-12-13 20:43:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:43:42,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:43:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:43:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-12-13 20:43:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:43:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-12-13 20:43:42,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:43:42,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289630462] [2022-12-13 20:43:42,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289630462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:43:42,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:43:42,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:43:42,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882992006] [2022-12-13 20:43:42,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:43:42,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:43:42,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:43:42,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:43:42,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:43:42,838 INFO L87 Difference]: Start difference. First operand 202246 states and 269505 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 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 20:44:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:44:02,545 INFO L93 Difference]: Finished difference Result 367558 states and 488120 transitions. [2022-12-13 20:44:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:44:02,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 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 187 [2022-12-13 20:44:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:44:02,948 INFO L225 Difference]: With dead ends: 367558 [2022-12-13 20:44:02,948 INFO L226 Difference]: Without dead ends: 165330 [2022-12-13 20:44:03,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:44:03,193 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 375 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 20:44:03,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 315 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 20:44:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165330 states. [2022-12-13 20:44:24,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165330 to 153002. [2022-12-13 20:44:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153002 states, 135636 states have (on average 1.2926877820047775) internal successors, (175335), 137955 states have internal predecessors, (175335), 8029 states have call successors, (8029), 6281 states have call predecessors, (8029), 9336 states have return successors, (19865), 8781 states have call predecessors, (19865), 8027 states have call successors, (19865) [2022-12-13 20:44:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153002 states to 153002 states and 203229 transitions. [2022-12-13 20:44:24,505 INFO L78 Accepts]: Start accepts. Automaton has 153002 states and 203229 transitions. Word has length 187 [2022-12-13 20:44:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:44:24,506 INFO L495 AbstractCegarLoop]: Abstraction has 153002 states and 203229 transitions. [2022-12-13 20:44:24,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 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 20:44:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 153002 states and 203229 transitions. [2022-12-13 20:44:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-13 20:44:24,606 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:44:24,606 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-12-13 20:44:24,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 20:44:24,606 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:44:24,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:44:24,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1804635440, now seen corresponding path program 1 times [2022-12-13 20:44:24,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:44:24,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128770191] [2022-12-13 20:44:24,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:44:24,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:44:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:44:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:44:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:44:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:44:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:44:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 20:44:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:44:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:44:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 20:44:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:44:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-12-13 20:44:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-13 20:44:24,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:44:24,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128770191] [2022-12-13 20:44:24,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128770191] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:44:24,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147179166] [2022-12-13 20:44:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:44:24,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:44:24,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:44:24,692 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:44:24,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 20:44:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:44:24,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:44:24,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:44:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 20:44:24,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:44:24,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147179166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:44:24,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:44:24,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:44:24,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235459752] [2022-12-13 20:44:24,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:44:24,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:44:24,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:44:24,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:44:24,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:44:24,807 INFO L87 Difference]: Start difference. First operand 153002 states and 203229 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 20:44:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:44:43,287 INFO L93 Difference]: Finished difference Result 261460 states and 359107 transitions. [2022-12-13 20:44:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:44:43,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 189 [2022-12-13 20:44:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:44:43,658 INFO L225 Difference]: With dead ends: 261460 [2022-12-13 20:44:43,658 INFO L226 Difference]: Without dead ends: 153550 [2022-12-13 20:44:43,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 210 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 20:44:43,857 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 176 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 563 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 20:44:43,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 563 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:44:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153550 states. [2022-12-13 20:45:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153550 to 153002. [2022-12-13 20:45:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153002 states, 135636 states have (on average 1.2742855878970185) internal successors, (172839), 137955 states have internal predecessors, (172839), 8029 states have call successors, (8029), 6281 states have call predecessors, (8029), 9336 states have return successors, (19865), 8781 states have call predecessors, (19865), 8027 states have call successors, (19865) [2022-12-13 20:45:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153002 states to 153002 states and 200733 transitions. [2022-12-13 20:45:02,860 INFO L78 Accepts]: Start accepts. Automaton has 153002 states and 200733 transitions. Word has length 189 [2022-12-13 20:45:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:45:02,860 INFO L495 AbstractCegarLoop]: Abstraction has 153002 states and 200733 transitions. [2022-12-13 20:45:02,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 20:45:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 153002 states and 200733 transitions. [2022-12-13 20:45:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-13 20:45:03,132 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:45:03,132 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 20:45:03,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 20:45:03,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 20:45:03,335 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:45:03,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:45:03,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1053670960, now seen corresponding path program 1 times [2022-12-13 20:45:03,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:45:03,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823872496] [2022-12-13 20:45:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:45:03,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:45:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:45:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:45:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:45:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:45:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:45:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 20:45:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:45:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:45:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 20:45:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:45:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-12-13 20:45:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-13 20:45:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:45:03,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823872496] [2022-12-13 20:45:03,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823872496] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:45:03,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818183429] [2022-12-13 20:45:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:45:03,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:45:03,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:45:03,472 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:45:03,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 20:45:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:03,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 20:45:03,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:45:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 20:45:03,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:45:03,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818183429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:45:03,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:45:03,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:45:03,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691794798] [2022-12-13 20:45:03,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:45:03,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:45:03,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:45:03,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:45:03,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:45:03,562 INFO L87 Difference]: Start difference. First operand 153002 states and 200733 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 20:45:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:45:19,738 INFO L93 Difference]: Finished difference Result 270343 states and 362090 transitions. [2022-12-13 20:45:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:45:19,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 189 [2022-12-13 20:45:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:45:20,047 INFO L225 Difference]: With dead ends: 270343 [2022-12-13 20:45:20,048 INFO L226 Difference]: Without dead ends: 127993 [2022-12-13 20:45:20,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 210 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 20:45:20,261 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 201 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 269 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 20:45:20,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 269 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:45:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127993 states. [2022-12-13 20:45:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127993 to 122245. [2022-12-13 20:45:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122245 states, 108643 states have (on average 1.2463113132001142) internal successors, (135403), 110443 states have internal predecessors, (135403), 6317 states have call successors, (6317), 4953 states have call predecessors, (6317), 7284 states have return successors, (14358), 6856 states have call predecessors, (14358), 6315 states have call successors, (14358) [2022-12-13 20:45:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122245 states to 122245 states and 156078 transitions. [2022-12-13 20:45:36,611 INFO L78 Accepts]: Start accepts. Automaton has 122245 states and 156078 transitions. Word has length 189 [2022-12-13 20:45:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:45:36,612 INFO L495 AbstractCegarLoop]: Abstraction has 122245 states and 156078 transitions. [2022-12-13 20:45:36,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 20:45:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 122245 states and 156078 transitions. [2022-12-13 20:45:36,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-13 20:45:36,671 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:45:36,671 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2022-12-13 20:45:36,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 20:45:36,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 20:45:36,873 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:45:36,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:45:36,874 INFO L85 PathProgramCache]: Analyzing trace with hash 368174038, now seen corresponding path program 1 times [2022-12-13 20:45:36,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:45:36,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629556058] [2022-12-13 20:45:36,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:45:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:45:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:36,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:45:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:45:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:36,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:45:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:36,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:45:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:36,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:45:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:36,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 20:45:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:36,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:45:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:36,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:45:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:36,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 20:45:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:36,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:45:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:36,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-12-13 20:45:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-13 20:45:36,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:45:37,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629556058] [2022-12-13 20:45:37,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629556058] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:45:37,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36345080] [2022-12-13 20:45:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:45:37,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:45:37,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:45:37,001 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:45:37,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 20:45:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:37,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:45:37,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:45:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 20:45:37,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:45:37,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36345080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:45:37,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:45:37,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:45:37,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145877982] [2022-12-13 20:45:37,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:45:37,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:45:37,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:45:37,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:45:37,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:45:37,098 INFO L87 Difference]: Start difference. First operand 122245 states and 156078 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 20:45:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:45:53,579 INFO L93 Difference]: Finished difference Result 207301 states and 272644 transitions. [2022-12-13 20:45:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:45:53,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 189 [2022-12-13 20:45:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:45:53,855 INFO L225 Difference]: With dead ends: 207301 [2022-12-13 20:45:53,855 INFO L226 Difference]: Without dead ends: 122612 [2022-12-13 20:45:53,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 210 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 20:45:53,997 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 169 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 611 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 20:45:53,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 611 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:45:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122612 states. [2022-12-13 20:46:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122612 to 122200. [2022-12-13 20:46:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122200 states, 108598 states have (on average 1.2243595646328662) internal successors, (132963), 110398 states have internal predecessors, (132963), 6317 states have call successors, (6317), 4953 states have call predecessors, (6317), 7284 states have return successors, (14358), 6856 states have call predecessors, (14358), 6315 states have call successors, (14358) [2022-12-13 20:46:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122200 states to 122200 states and 153638 transitions. [2022-12-13 20:46:09,852 INFO L78 Accepts]: Start accepts. Automaton has 122200 states and 153638 transitions. Word has length 189 [2022-12-13 20:46:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:46:09,852 INFO L495 AbstractCegarLoop]: Abstraction has 122200 states and 153638 transitions. [2022-12-13 20:46:09,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 20:46:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 122200 states and 153638 transitions. [2022-12-13 20:46:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-12-13 20:46:09,910 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:46:09,910 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 20:46:09,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 20:46:10,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 20:46:10,112 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:46:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:46:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash 644004185, now seen corresponding path program 1 times [2022-12-13 20:46:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:46:10,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457674341] [2022-12-13 20:46:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:46:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:46:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:46:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:46:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:46:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:46:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:46:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 20:46:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:46:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:46:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 20:46:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:46:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-12-13 20:46:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-13 20:46:10,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:46:10,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457674341] [2022-12-13 20:46:10,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457674341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:46:10,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869672762] [2022-12-13 20:46:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:46:10,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:46:10,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:46:10,219 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:46:10,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 20:46:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:10,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:46:10,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:46:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 20:46:10,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:46:10,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869672762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:46:10,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:46:10,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:46:10,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478867781] [2022-12-13 20:46:10,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:46:10,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:46:10,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:46:10,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:46:10,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:46:10,322 INFO L87 Difference]: Start difference. First operand 122200 states and 153638 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 20:46:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:46:26,268 INFO L93 Difference]: Finished difference Result 207160 states and 268550 transitions. [2022-12-13 20:46:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:46:26,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 189 [2022-12-13 20:46:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:46:26,554 INFO L225 Difference]: With dead ends: 207160 [2022-12-13 20:46:26,554 INFO L226 Difference]: Without dead ends: 122612 [2022-12-13 20:46:26,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 210 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 20:46:26,680 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 165 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 615 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 20:46:26,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 615 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:46:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122612 states. [2022-12-13 20:46:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122612 to 122200. [2022-12-13 20:46:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122200 states, 108598 states have (on average 1.202628041032063) internal successors, (130603), 110398 states have internal predecessors, (130603), 6317 states have call successors, (6317), 4953 states have call predecessors, (6317), 7284 states have return successors, (14358), 6856 states have call predecessors, (14358), 6315 states have call successors, (14358) [2022-12-13 20:46:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122200 states to 122200 states and 151278 transitions. [2022-12-13 20:46:44,281 INFO L78 Accepts]: Start accepts. Automaton has 122200 states and 151278 transitions. Word has length 189 [2022-12-13 20:46:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:46:44,282 INFO L495 AbstractCegarLoop]: Abstraction has 122200 states and 151278 transitions. [2022-12-13 20:46:44,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 20:46:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 122200 states and 151278 transitions. [2022-12-13 20:46:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-12-13 20:46:44,339 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:46:44,339 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 20:46:44,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 20:46:44,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 20:46:44,541 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:46:44,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:46:44,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2070194639, now seen corresponding path program 1 times [2022-12-13 20:46:44,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:46:44,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650478476] [2022-12-13 20:46:44,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:46:44,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:46:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:46:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:46:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:46:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:46:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:46:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 20:46:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:46:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:46:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 20:46:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:46:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-12-13 20:46:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-13 20:46:44,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:46:44,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650478476] [2022-12-13 20:46:44,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650478476] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:46:44,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187131273] [2022-12-13 20:46:44,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:46:44,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:46:44,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:46:44,654 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:46:44,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 20:46:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:44,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 20:46:44,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:46:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 20:46:44,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:46:44,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187131273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:46:44,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:46:44,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 20:46:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768705410] [2022-12-13 20:46:44,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:46:44,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:46:44,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:46:44,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:46:44,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:46:44,740 INFO L87 Difference]: Start difference. First operand 122200 states and 151278 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 20:47:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:47:00,344 INFO L93 Difference]: Finished difference Result 182307 states and 230979 transitions. [2022-12-13 20:47:00,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:47:00,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 190 [2022-12-13 20:47:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:47:00,614 INFO L225 Difference]: With dead ends: 182307 [2022-12-13 20:47:00,614 INFO L226 Difference]: Without dead ends: 122350 [2022-12-13 20:47:00,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:47:00,731 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 192 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:47:00,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 582 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:47:00,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122350 states. [2022-12-13 20:47:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122350 to 122200. [2022-12-13 20:47:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122200 states, 108598 states have (on average 1.1944142617727767) internal successors, (129711), 110398 states have internal predecessors, (129711), 6317 states have call successors, (6317), 4953 states have call predecessors, (6317), 7284 states have return successors, (14358), 6856 states have call predecessors, (14358), 6315 states have call successors, (14358) [2022-12-13 20:47:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122200 states to 122200 states and 150386 transitions. [2022-12-13 20:47:18,441 INFO L78 Accepts]: Start accepts. Automaton has 122200 states and 150386 transitions. Word has length 190 [2022-12-13 20:47:18,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:47:18,441 INFO L495 AbstractCegarLoop]: Abstraction has 122200 states and 150386 transitions. [2022-12-13 20:47:18,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 20:47:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 122200 states and 150386 transitions. [2022-12-13 20:47:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-13 20:47:18,513 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:47:18,514 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:47:18,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 20:47:18,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:47:18,715 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:47:18,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:47:18,716 INFO L85 PathProgramCache]: Analyzing trace with hash -718141972, now seen corresponding path program 1 times [2022-12-13 20:47:18,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:47:18,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786239625] [2022-12-13 20:47:18,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:47:18,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:47:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:47:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:47:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:47:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:47:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:47:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 20:47:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:47:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:47:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 20:47:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:47:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-12-13 20:47:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-13 20:47:18,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:47:18,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786239625] [2022-12-13 20:47:18,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786239625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:47:18,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556110768] [2022-12-13 20:47:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:47:18,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:47:18,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:47:18,805 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:47:18,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 20:47:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:18,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:47:18,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:47:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 20:47:18,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:47:18,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556110768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:47:18,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:47:18,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 20:47:18,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274458941] [2022-12-13 20:47:18,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:47:18,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:47:18,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:47:18,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:47:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:47:18,993 INFO L87 Difference]: Start difference. First operand 122200 states and 150386 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 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 20:47:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:47:30,473 INFO L93 Difference]: Finished difference Result 166128 states and 205489 transitions. [2022-12-13 20:47:30,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:47:30,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 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 191 [2022-12-13 20:47:30,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:47:30,645 INFO L225 Difference]: With dead ends: 166128 [2022-12-13 20:47:30,645 INFO L226 Difference]: Without dead ends: 85736 [2022-12-13 20:47:30,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 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 20:47:30,734 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 232 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:47:30,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 370 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 20:47:30,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85736 states. [2022-12-13 20:47:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85736 to 85436. [2022-12-13 20:47:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85436 states, 75982 states have (on average 1.1784764812718802) internal successors, (89543), 77165 states have internal predecessors, (89543), 4437 states have call successors, (4437), 3457 states have call predecessors, (4437), 5016 states have return successors, (9899), 4817 states have call predecessors, (9899), 4435 states have call successors, (9899) [2022-12-13 20:47:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85436 states to 85436 states and 103879 transitions. [2022-12-13 20:47:42,160 INFO L78 Accepts]: Start accepts. Automaton has 85436 states and 103879 transitions. Word has length 191 [2022-12-13 20:47:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:47:42,160 INFO L495 AbstractCegarLoop]: Abstraction has 85436 states and 103879 transitions. [2022-12-13 20:47:42,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 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 20:47:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 85436 states and 103879 transitions. [2022-12-13 20:47:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-13 20:47:42,189 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:47:42,189 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:47:42,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 20:47:42,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:47:42,390 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:47:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:47:42,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1440942122, now seen corresponding path program 1 times [2022-12-13 20:47:42,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:47:42,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333290205] [2022-12-13 20:47:42,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:47:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:47:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:47:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:47:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:47:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:47:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:47:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 20:47:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:47:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:47:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 20:47:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:47:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-12-13 20:47:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-13 20:47:42,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:47:42,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333290205] [2022-12-13 20:47:42,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333290205] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:47:42,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137349554] [2022-12-13 20:47:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:47:42,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:47:42,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:47:42,480 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:47:42,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 20:47:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:47:42,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:47:42,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:47:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 20:47:42,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:47:42,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137349554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:47:42,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:47:42,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 20:47:42,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758683646] [2022-12-13 20:47:42,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:47:42,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:47:42,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:47:42,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:47:42,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:47:42,613 INFO L87 Difference]: Start difference. First operand 85436 states and 103879 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 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 20:47:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:47:54,783 INFO L93 Difference]: Finished difference Result 170424 states and 208176 transitions. [2022-12-13 20:47:54,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:47:54,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 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 191 [2022-12-13 20:47:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:47:54,968 INFO L225 Difference]: With dead ends: 170424 [2022-12-13 20:47:54,968 INFO L226 Difference]: Without dead ends: 85004 [2022-12-13 20:47:55,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 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 20:47:55,061 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 228 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:47:55,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 363 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:47:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85004 states. [2022-12-13 20:48:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85004 to 85004. [2022-12-13 20:48:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85004 states, 75550 states have (on average 1.1609133024487095) internal successors, (87707), 76733 states have internal predecessors, (87707), 4437 states have call successors, (4437), 3457 states have call predecessors, (4437), 5016 states have return successors, (9899), 4817 states have call predecessors, (9899), 4435 states have call successors, (9899) [2022-12-13 20:48:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85004 states to 85004 states and 102043 transitions. [2022-12-13 20:48:06,738 INFO L78 Accepts]: Start accepts. Automaton has 85004 states and 102043 transitions. Word has length 191 [2022-12-13 20:48:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:48:06,738 INFO L495 AbstractCegarLoop]: Abstraction has 85004 states and 102043 transitions. [2022-12-13 20:48:06,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 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 20:48:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 85004 states and 102043 transitions. [2022-12-13 20:48:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-13 20:48:06,767 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:48:06,768 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:48:06,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 20:48:06,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-13 20:48:06,968 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:48:06,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:48:06,968 INFO L85 PathProgramCache]: Analyzing trace with hash -346927700, now seen corresponding path program 1 times [2022-12-13 20:48:06,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:48:06,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85537472] [2022-12-13 20:48:06,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:06,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:48:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:06,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:48:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:48:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:07,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:48:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:07,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:48:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:48:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:07,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 20:48:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:07,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:48:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:07,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 20:48:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:07,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-12-13 20:48:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-13 20:48:07,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:48:07,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85537472] [2022-12-13 20:48:07,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85537472] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:48:07,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761839974] [2022-12-13 20:48:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:07,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:48:07,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:48:07,047 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:48:07,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 20:48:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:07,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 20:48:07,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:48:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-12-13 20:48:07,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:48:07,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761839974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:48:07,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:48:07,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 20:48:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000974500] [2022-12-13 20:48:07,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:48:07,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:48:07,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:48:07,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:48:07,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:48:07,202 INFO L87 Difference]: Start difference. First operand 85004 states and 102043 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 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 20:48:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:48:16,104 INFO L93 Difference]: Finished difference Result 128740 states and 155394 transitions. [2022-12-13 20:48:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:48:16,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 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 191 [2022-12-13 20:48:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:48:16,232 INFO L225 Difference]: With dead ends: 128740 [2022-12-13 20:48:16,232 INFO L226 Difference]: Without dead ends: 64056 [2022-12-13 20:48:16,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 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 20:48:16,301 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 221 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:48:16,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 356 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:48:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64056 states. [2022-12-13 20:48:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64056 to 43942. [2022-12-13 20:48:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43942 states, 39131 states have (on average 1.1463034422836114) internal successors, (44856), 39725 states have internal predecessors, (44856), 2291 states have call successors, (2291), 1739 states have call predecessors, (2291), 2519 states have return successors, (5153), 2479 states have call predecessors, (5153), 2289 states have call successors, (5153) [2022-12-13 20:48:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43942 states to 43942 states and 52300 transitions. [2022-12-13 20:48:23,514 INFO L78 Accepts]: Start accepts. Automaton has 43942 states and 52300 transitions. Word has length 191 [2022-12-13 20:48:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:48:23,515 INFO L495 AbstractCegarLoop]: Abstraction has 43942 states and 52300 transitions. [2022-12-13 20:48:23,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 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 20:48:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 43942 states and 52300 transitions. [2022-12-13 20:48:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-13 20:48:23,529 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:48:23,530 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:48:23,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 20:48:23,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:48:23,731 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:48:23,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:48:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash -277279826, now seen corresponding path program 1 times [2022-12-13 20:48:23,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:48:23,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573233232] [2022-12-13 20:48:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:48:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:48:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:48:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:48:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:48:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:48:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 20:48:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:48:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-12-13 20:48:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-12-13 20:48:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-12-13 20:48:23,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:48:23,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573233232] [2022-12-13 20:48:23,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573233232] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:48:23,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407109528] [2022-12-13 20:48:23,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:23,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:48:23,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:48:23,857 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:48:23,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 20:48:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:23,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 20:48:23,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:48:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-13 20:48:23,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:48:23,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407109528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:48:23,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:48:23,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 20:48:23,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484532808] [2022-12-13 20:48:23,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:48:23,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:48:23,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:48:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:48:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:48:23,951 INFO L87 Difference]: Start difference. First operand 43942 states and 52300 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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 20:48:30,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:48:30,340 INFO L93 Difference]: Finished difference Result 74496 states and 89787 transitions. [2022-12-13 20:48:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:48:30,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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 191 [2022-12-13 20:48:30,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:48:30,394 INFO L225 Difference]: With dead ends: 74496 [2022-12-13 20:48:30,394 INFO L226 Difference]: Without dead ends: 30566 [2022-12-13 20:48:30,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:48:30,444 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 126 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 879 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 20:48:30,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 879 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:48:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30566 states. [2022-12-13 20:48:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30566 to 28686. [2022-12-13 20:48:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28686 states, 25393 states have (on average 1.1297207891938723) internal successors, (28687), 25785 states have internal predecessors, (28687), 1573 states have call successors, (1573), 1206 states have call predecessors, (1573), 1719 states have return successors, (3105), 1695 states have call predecessors, (3105), 1571 states have call successors, (3105) [2022-12-13 20:48:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28686 states to 28686 states and 33365 transitions. [2022-12-13 20:48:35,201 INFO L78 Accepts]: Start accepts. Automaton has 28686 states and 33365 transitions. Word has length 191 [2022-12-13 20:48:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:48:35,201 INFO L495 AbstractCegarLoop]: Abstraction has 28686 states and 33365 transitions. [2022-12-13 20:48:35,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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 20:48:35,201 INFO L276 IsEmpty]: Start isEmpty. Operand 28686 states and 33365 transitions. [2022-12-13 20:48:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-13 20:48:35,209 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:48:35,209 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:48:35,213 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 20:48:35,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:48:35,410 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:48:35,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:48:35,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1182203527, now seen corresponding path program 1 times [2022-12-13 20:48:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:48:35,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189246126] [2022-12-13 20:48:35,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:48:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:48:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:48:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:48:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:48:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:48:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 20:48:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:48:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-12-13 20:48:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-12-13 20:48:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-13 20:48:35,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:48:35,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189246126] [2022-12-13 20:48:35,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189246126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:48:35,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578990393] [2022-12-13 20:48:35,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:35,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:48:35,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:48:35,528 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:48:35,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 20:48:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:35,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 20:48:35,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:48:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-12-13 20:48:35,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:48:35,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578990393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:48:35,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:48:35,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 20:48:35,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650005844] [2022-12-13 20:48:35,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:48:35,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:48:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:48:35,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:48:35,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:48:35,653 INFO L87 Difference]: Start difference. First operand 28686 states and 33365 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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 20:48:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:48:39,789 INFO L93 Difference]: Finished difference Result 53065 states and 62564 transitions. [2022-12-13 20:48:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:48:39,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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 191 [2022-12-13 20:48:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:48:39,831 INFO L225 Difference]: With dead ends: 53065 [2022-12-13 20:48:39,831 INFO L226 Difference]: Without dead ends: 24391 [2022-12-13 20:48:39,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 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 20:48:39,885 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 88 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 865 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 20:48:39,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 865 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:48:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24391 states. [2022-12-13 20:48:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24391 to 23381. [2022-12-13 20:48:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23381 states, 20598 states have (on average 1.1129235848140595) internal successors, (22924), 20911 states have internal predecessors, (22924), 1342 states have call successors, (1342), 1020 states have call predecessors, (1342), 1440 states have return successors, (2343), 1450 states have call predecessors, (2343), 1340 states have call successors, (2343) [2022-12-13 20:48:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23381 states to 23381 states and 26609 transitions. [2022-12-13 20:48:43,726 INFO L78 Accepts]: Start accepts. Automaton has 23381 states and 26609 transitions. Word has length 191 [2022-12-13 20:48:43,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:48:43,727 INFO L495 AbstractCegarLoop]: Abstraction has 23381 states and 26609 transitions. [2022-12-13 20:48:43,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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 20:48:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 23381 states and 26609 transitions. [2022-12-13 20:48:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-13 20:48:43,733 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:48:43,733 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:48:43,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-13 20:48:43,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 20:48:43,934 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:48:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:48:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1921856819, now seen corresponding path program 1 times [2022-12-13 20:48:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:48:43,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215639847] [2022-12-13 20:48:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:48:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:43,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:48:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:44,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:48:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:44,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:48:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:44,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:48:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:44,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:48:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:44,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 20:48:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:44,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:48:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:44,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:44,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-12-13 20:48:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:44,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:44,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-12-13 20:48:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-12-13 20:48:44,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:48:44,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215639847] [2022-12-13 20:48:44,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215639847] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:48:44,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302703392] [2022-12-13 20:48:44,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:44,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:48:44,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:48:44,063 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:48:44,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 20:48:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:44,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 20:48:44,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:48:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-13 20:48:44,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:48:44,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302703392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:48:44,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:48:44,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 20:48:44,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734686284] [2022-12-13 20:48:44,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:48:44,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:48:44,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:48:44,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:48:44,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:48:44,161 INFO L87 Difference]: Start difference. First operand 23381 states and 26609 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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 20:48:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:48:47,122 INFO L93 Difference]: Finished difference Result 41330 states and 47601 transitions. [2022-12-13 20:48:47,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:48:47,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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 191 [2022-12-13 20:48:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:48:47,152 INFO L225 Difference]: With dead ends: 41330 [2022-12-13 20:48:47,152 INFO L226 Difference]: Without dead ends: 17961 [2022-12-13 20:48:47,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:48:47,174 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 49 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 850 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 20:48:47,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 850 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:48:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17961 states. [2022-12-13 20:48:50,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17961 to 17765. [2022-12-13 20:48:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17765 states, 15618 states have (on average 1.0944423101549494) internal successors, (17093), 15831 states have internal predecessors, (17093), 1062 states have call successors, (1062), 800 states have call predecessors, (1062), 1084 states have return successors, (1623), 1134 states have call predecessors, (1623), 1060 states have call successors, (1623) [2022-12-13 20:48:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17765 states to 17765 states and 19778 transitions. [2022-12-13 20:48:50,053 INFO L78 Accepts]: Start accepts. Automaton has 17765 states and 19778 transitions. Word has length 191 [2022-12-13 20:48:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:48:50,053 INFO L495 AbstractCegarLoop]: Abstraction has 17765 states and 19778 transitions. [2022-12-13 20:48:50,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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 20:48:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 17765 states and 19778 transitions. [2022-12-13 20:48:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-12-13 20:48:50,057 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:48:50,057 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:48:50,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-12-13 20:48:50,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 20:48:50,258 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:48:50,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:48:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2134295443, now seen corresponding path program 1 times [2022-12-13 20:48:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:48:50,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095257821] [2022-12-13 20:48:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:48:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:48:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:48:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:48:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:48:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:48:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 20:48:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 20:48:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-12-13 20:48:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-12-13 20:48:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-12-13 20:48:50,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:48:50,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095257821] [2022-12-13 20:48:50,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095257821] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:48:50,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862505596] [2022-12-13 20:48:50,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:50,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:48:50,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:48:50,395 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:48:50,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 20:48:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:50,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 20:48:50,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:48:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-13 20:48:50,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 20:48:50,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862505596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:48:50,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 20:48:50,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 20:48:50,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535598476] [2022-12-13 20:48:50,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:48:50,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:48:50,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:48:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:48:50,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:48:50,483 INFO L87 Difference]: Start difference. First operand 17765 states and 19778 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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 20:48:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:48:51,526 INFO L93 Difference]: Finished difference Result 24461 states and 27282 transitions. [2022-12-13 20:48:51,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:48:51,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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 191 [2022-12-13 20:48:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:48:51,534 INFO L225 Difference]: With dead ends: 24461 [2022-12-13 20:48:51,534 INFO L226 Difference]: Without dead ends: 4120 [2022-12-13 20:48:51,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 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 20:48:51,545 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 10 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 835 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 20:48:51,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 835 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:48:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2022-12-13 20:48:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4120. [2022-12-13 20:48:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4120 states, 3613 states have (on average 1.0686410185441462) internal successors, (3861), 3633 states have internal predecessors, (3861), 289 states have call successors, (289), 202 states have call predecessors, (289), 217 states have return successors, (303), 285 states have call predecessors, (303), 287 states have call successors, (303) [2022-12-13 20:48:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 4453 transitions. [2022-12-13 20:48:52,115 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 4453 transitions. Word has length 191 [2022-12-13 20:48:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:48:52,115 INFO L495 AbstractCegarLoop]: Abstraction has 4120 states and 4453 transitions. [2022-12-13 20:48:52,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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 20:48:52,115 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 4453 transitions. [2022-12-13 20:48:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-12-13 20:48:52,118 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:48:52,118 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:48:52,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-13 20:48:52,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 20:48:52,320 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:48:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:48:52,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1627351055, now seen corresponding path program 1 times [2022-12-13 20:48:52,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:48:52,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253599961] [2022-12-13 20:48:52,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:52,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:48:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:48:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:48:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:48:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:48:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:48:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 20:48:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 20:48:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 20:48:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-12-13 20:48:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-12-13 20:48:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-12-13 20:48:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2022-12-13 20:48:52,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:48:52,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253599961] [2022-12-13 20:48:52,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253599961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:48:52,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:48:52,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 20:48:52,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691987962] [2022-12-13 20:48:52,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:48:52,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:48:52,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:48:52,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:48:52,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:48:52,532 INFO L87 Difference]: Start difference. First operand 4120 states and 4453 transitions. Second operand has 8 states, 8 states have (on average 17.625) internal successors, (141), 6 states have internal predecessors, (141), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2022-12-13 20:48:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:48:54,115 INFO L93 Difference]: Finished difference Result 4266 states and 4598 transitions. [2022-12-13 20:48:54,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 20:48:54,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 6 states have internal predecessors, (141), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 282 [2022-12-13 20:48:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:48:54,122 INFO L225 Difference]: With dead ends: 4266 [2022-12-13 20:48:54,122 INFO L226 Difference]: Without dead ends: 4263 [2022-12-13 20:48:54,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-12-13 20:48:54,123 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 1093 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 20:48:54,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1339 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 20:48:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2022-12-13 20:48:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 4119. [2022-12-13 20:48:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4119 states, 3613 states have (on average 1.0680874619429837) internal successors, (3859), 3632 states have internal predecessors, (3859), 288 states have call successors, (288), 202 states have call predecessors, (288), 217 states have return successors, (303), 285 states have call predecessors, (303), 287 states have call successors, (303) [2022-12-13 20:48:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4119 states to 4119 states and 4450 transitions. [2022-12-13 20:48:54,718 INFO L78 Accepts]: Start accepts. Automaton has 4119 states and 4450 transitions. Word has length 282 [2022-12-13 20:48:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:48:54,718 INFO L495 AbstractCegarLoop]: Abstraction has 4119 states and 4450 transitions. [2022-12-13 20:48:54,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.625) internal successors, (141), 6 states have internal predecessors, (141), 7 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2022-12-13 20:48:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 4119 states and 4450 transitions. [2022-12-13 20:48:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-12-13 20:48:54,721 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:48:54,722 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:48:54,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 20:48:54,722 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:48:54,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:48:54,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451993, now seen corresponding path program 1 times [2022-12-13 20:48:54,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:48:54,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405635711] [2022-12-13 20:48:54,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:54,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:48:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 20:48:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 20:48:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 20:48:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-12-13 20:48:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 20:48:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-12-13 20:48:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 20:48:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 20:48:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-12-13 20:48:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-12-13 20:48:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 20:48:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-12-13 20:48:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:48:54,793 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2022-12-13 20:48:54,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:48:54,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405635711] [2022-12-13 20:48:54,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405635711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:48:54,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:48:54,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:48:54,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933806597] [2022-12-13 20:48:54,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:48:54,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:48:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:48:54,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:48:54,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:48:54,794 INFO L87 Difference]: Start difference. First operand 4119 states and 4450 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 20:48:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:48:55,711 INFO L93 Difference]: Finished difference Result 5752 states and 6270 transitions. [2022-12-13 20:48:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:48:55,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 286 [2022-12-13 20:48:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:48:55,718 INFO L225 Difference]: With dead ends: 5752 [2022-12-13 20:48:55,718 INFO L226 Difference]: Without dead ends: 4619 [2022-12-13 20:48:55,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:48:55,721 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 248 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 20:48:55,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 611 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 20:48:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2022-12-13 20:48:56,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4121. [2022-12-13 20:48:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4121 states, 3615 states have (on average 1.0680497925311203) internal successors, (3861), 3634 states have internal predecessors, (3861), 288 states have call successors, (288), 202 states have call predecessors, (288), 217 states have return successors, (303), 285 states have call predecessors, (303), 287 states have call successors, (303) [2022-12-13 20:48:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 4452 transitions. [2022-12-13 20:48:56,310 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 4452 transitions. Word has length 286 [2022-12-13 20:48:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:48:56,310 INFO L495 AbstractCegarLoop]: Abstraction has 4121 states and 4452 transitions. [2022-12-13 20:48:56,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 20:48:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 4452 transitions. [2022-12-13 20:48:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-12-13 20:48:56,313 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:48:56,314 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:48:56,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 20:48:56,314 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:48:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:48:56,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1155596267, now seen corresponding path program 1 times [2022-12-13 20:48:56,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:48:56,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427556758] [2022-12-13 20:48:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:48:56,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:48:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:48:56,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:48:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:48:56,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:48:56,383 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:48:56,384 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 20:48:56,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 20:48:56,387 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:48:56,390 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:48:56,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:48:56 BoogieIcfgContainer [2022-12-13 20:48:56,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:48:56,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:48:56,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:48:56,495 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:48:56,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:37:47" (3/4) ... [2022-12-13 20:48:56,497 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 20:48:56,590 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:48:56,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:48:56,591 INFO L158 Benchmark]: Toolchain (without parser) took 669855.38ms. Allocated memory was 130.0MB in the beginning and 8.4GB in the end (delta: 8.2GB). Free memory was 94.6MB in the beginning and 923.5MB in the end (delta: -828.9MB). Peak memory consumption was 7.4GB. Max. memory is 16.1GB. [2022-12-13 20:48:56,591 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:48:56,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.51ms. Allocated memory is still 130.0MB. Free memory was 94.2MB in the beginning and 79.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 20:48:56,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.89ms. Allocated memory is still 130.0MB. Free memory was 79.5MB in the beginning and 77.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:48:56,591 INFO L158 Benchmark]: Boogie Preprocessor took 32.08ms. Allocated memory is still 130.0MB. Free memory was 77.0MB in the beginning and 75.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:48:56,592 INFO L158 Benchmark]: RCFGBuilder took 458.02ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 75.0MB in the beginning and 118.5MB in the end (delta: -43.5MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2022-12-13 20:48:56,592 INFO L158 Benchmark]: TraceAbstraction took 668956.59ms. Allocated memory was 157.3MB in the beginning and 8.4GB in the end (delta: 8.2GB). Free memory was 118.5MB in the beginning and 951.7MB in the end (delta: -833.2MB). Peak memory consumption was 7.4GB. Max. memory is 16.1GB. [2022-12-13 20:48:56,592 INFO L158 Benchmark]: Witness Printer took 95.94ms. Allocated memory is still 8.4GB. Free memory was 951.7MB in the beginning and 923.5MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 20:48:56,593 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.51ms. Allocated memory is still 130.0MB. Free memory was 94.2MB in the beginning and 79.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.89ms. Allocated memory is still 130.0MB. Free memory was 79.5MB in the beginning and 77.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.08ms. Allocated memory is still 130.0MB. Free memory was 77.0MB in the beginning and 75.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 458.02ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 75.0MB in the beginning and 118.5MB in the end (delta: -43.5MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 668956.59ms. Allocated memory was 157.3MB in the beginning and 8.4GB in the end (delta: 8.2GB). Free memory was 118.5MB in the beginning and 951.7MB in the end (delta: -833.2MB). Peak memory consumption was 7.4GB. Max. memory is 16.1GB. * Witness Printer took 95.94ms. Allocated memory is still 8.4GB. Free memory was 951.7MB in the beginning and 923.5MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int t2_pc = 0; [L27] int t3_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int t3_st ; [L32] int m_i ; [L33] int t1_i ; [L34] int t2_i ; [L35] int t3_i ; [L36] int M_E = 2; [L37] int T1_E = 2; [L38] int T2_E = 2; [L39] int T3_E = 2; [L40] int E_M = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L49] int token ; [L51] int local ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L735] int __retres1 ; [L739] CALL init_model() [L648] m_i = 1 [L649] t1_i = 1 [L650] t2_i = 1 [L651] t3_i = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L739] RET init_model() [L740] CALL start_simulation() [L676] int kernel_st ; [L677] int tmp ; [L678] int tmp___0 ; [L682] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L683] FCALL update_channels() VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L684] CALL init_threads() [L304] COND TRUE m_i == 1 [L305] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L309] COND TRUE t1_i == 1 [L310] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L314] COND TRUE t2_i == 1 [L315] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L319] COND TRUE t3_i == 1 [L320] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L684] RET init_threads() [L685] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L441] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L446] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L451] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L456] COND FALSE !(T3_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L461] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L466] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L471] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L476] COND FALSE !(E_3 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L685] RET fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L686] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L220] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L230] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L232] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, token=0] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L239] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L249] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L251] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L258] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L268] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L270] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L277] COND FALSE !(t3_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L287] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L289] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L686] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L687] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L489] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L494] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L499] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L504] COND FALSE !(T3_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L509] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L514] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L519] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L524] COND FALSE !(E_3 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L687] RET reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L690] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L693] kernel_st = 1 [L694] CALL eval() [L360] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L364] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L367] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L355] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L367] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, token=0] [L388] COND TRUE t1_st == 0 [L389] int tmp_ndt_2; [L390] tmp_ndt_2 = __VERIFIER_nondet_int() [L391] COND TRUE \read(tmp_ndt_2) [L393] t1_st = 1 [L394] CALL transmit1() [L112] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L123] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L125] t1_pc = 1 [L126] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L394] RET transmit1() [L402] COND TRUE t2_st == 0 [L403] int tmp_ndt_3; [L404] tmp_ndt_3 = __VERIFIER_nondet_int() [L405] COND TRUE \read(tmp_ndt_3) [L407] t2_st = 1 [L408] CALL transmit2() [L148] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L159] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L161] t2_pc = 1 [L162] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L408] RET transmit2() [L416] COND TRUE t3_st == 0 [L417] int tmp_ndt_4; [L418] tmp_ndt_4 = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp_ndt_4) [L421] t3_st = 1 [L422] CALL transmit3() [L184] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L195] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L197] t3_pc = 1 [L198] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L422] RET transmit3() [L364] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, tmp_ndt_4=1, token=0] [L367] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L355] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L367] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, tmp_ndt_4=1, token=0] [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=-1, tmp_ndt_4=1, token=0] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND TRUE \read(tmp_ndt_1) [L379] m_st = 1 [L380] CALL master() [L54] int tmp_var = __VERIFIER_nondet_int(); [L56] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L67] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L70] token = __VERIFIER_nondet_int() [L71] local = token [L72] E_1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L73] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L581] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L220] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L230] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L232] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=0] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L239] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L240] COND TRUE E_1 == 1 [L241] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L251] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND TRUE \read(tmp___0) [L552] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, token=0] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L258] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L259] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L268] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L270] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L277] COND TRUE t3_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L278] COND FALSE !(E_3 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L287] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L289] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L581] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L73] RET immediate_notify() VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L74] E_1 = 2 [L75] m_pc = 1 [L76] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L380] RET master() [L388] COND TRUE t1_st == 0 [L389] int tmp_ndt_2; [L390] tmp_ndt_2 = __VERIFIER_nondet_int() [L391] COND TRUE \read(tmp_ndt_2) [L393] t1_st = 1 [L394] CALL transmit1() [L112] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L115] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L131] token += 1 [L132] E_2 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L133] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L581] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L220] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L221] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L230] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L232] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=1] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L239] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L240] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L249] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L251] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=1] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L258] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L259] COND TRUE E_2 == 1 [L260] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L270] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND TRUE \read(tmp___1) [L560] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, token=1] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L277] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L278] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L287] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L289] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L581] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L133] RET immediate_notify() VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L134] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L123] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L125] t1_pc = 1 [L126] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L394] RET transmit1() [L402] COND TRUE t2_st == 0 [L403] int tmp_ndt_3; [L404] tmp_ndt_3 = __VERIFIER_nondet_int() [L405] COND TRUE \read(tmp_ndt_3) [L407] t2_st = 1 [L408] CALL transmit2() [L148] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L151] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L167] token += 1 [L168] E_3 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L169] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L581] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L220] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L221] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L230] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L232] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=2] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L239] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L240] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L249] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L251] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=2] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L258] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L259] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L268] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L270] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=0, __retres1=0, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L277] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L278] COND TRUE E_3 == 1 [L279] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L289] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, \result=1, __retres1=1, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND TRUE \read(tmp___2) [L568] t3_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L581] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L169] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L170] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L159] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L161] t2_pc = 1 [L162] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L408] RET transmit2() [L416] COND TRUE t3_st == 0 [L417] int tmp_ndt_4; [L418] tmp_ndt_4 = __VERIFIER_nondet_int() [L419] COND TRUE \read(tmp_ndt_4) [L421] t3_st = 1 [L422] CALL transmit3() [L184] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L187] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L203] token += 1 [L204] E_M = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L205] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L581] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L534] int tmp ; [L535] int tmp___0 ; [L536] int tmp___1 ; [L537] int tmp___2 ; [L541] CALL, EXPR is_master_triggered() [L217] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L220] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L221] COND TRUE E_M == 1 [L222] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L232] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L541] RET, EXPR is_master_triggered() [L541] tmp = is_master_triggered() [L543] COND TRUE \read(tmp) [L544] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, token=3] [L549] CALL, EXPR is_transmit1_triggered() [L236] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L239] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L240] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L249] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L251] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L549] RET, EXPR is_transmit1_triggered() [L549] tmp___0 = is_transmit1_triggered() [L551] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, token=3] [L557] CALL, EXPR is_transmit2_triggered() [L255] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L258] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L259] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L268] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L270] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L557] RET, EXPR is_transmit2_triggered() [L557] tmp___1 = is_transmit2_triggered() [L559] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, token=3] [L565] CALL, EXPR is_transmit3_triggered() [L274] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L277] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L278] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L287] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L289] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, \result=0, __retres1=0, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L565] RET, EXPR is_transmit3_triggered() [L565] tmp___2 = is_transmit3_triggered() [L567] COND FALSE !(\read(tmp___2)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L581] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L205] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L206] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L195] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L197] t3_pc = 1 [L198] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L422] RET transmit3() [L364] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=-2, tmp_ndt_4=1, token=3] [L367] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L329] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L332] COND TRUE m_st == 0 [L333] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L355] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L367] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=-2, tmp_ndt_4=1, token=3] [L367] tmp = exists_runnable_thread() [L369] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=1, tmp_ndt_3=-2, tmp_ndt_4=1, token=3] [L374] COND TRUE m_st == 0 [L375] int tmp_ndt_1; [L376] tmp_ndt_1 = __VERIFIER_nondet_int() [L377] COND TRUE \read(tmp_ndt_1) [L379] m_st = 1 [L380] CALL master() [L54] int tmp_var = __VERIFIER_nondet_int(); [L56] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L59] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L81] COND FALSE !(token != local + 3) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L86] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L87] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L92] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L93] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L94] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L95] CALL error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L20] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 668.8s, OverallIterations: 40, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 2.6s, AutomataDifference: 334.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11593 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11347 mSDsluCounter, 23892 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13811 mSDsCounter, 860 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12279 IncrementalHoareTripleChecker+Invalid, 13139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 860 mSolverCounterUnsat, 10081 mSDtfsCounter, 12279 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5756 GetRequests, 5438 SyntacticMatches, 8 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211884occurred in iteration=20, InterpolantAutomatonStates: 235, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 318.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 138372 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 11302 NumberOfCodeBlocks, 11302 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 10950 ConstructedInterpolants, 0 QuantifiedInterpolants, 18148 SizeOfPredicates, 12 NumberOfNonLiveVariables, 15754 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 65 InterpolantComputations, 39 PerfectInterpolantSequences, 5670/6713 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 20:48:56,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e234e98-1d7b-4c5d-9272-fdce156c2efe/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