./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/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_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/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_c7e82dee-9236-4560-98cf-04345930981a/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 a145625a0fe2baedf73b7a84d58038ade27f8470c6f09a0f78d8ec75fe662acb --- 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 15:18:34,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:18:34,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:18:34,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:18:34,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:18:34,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:18:34,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:18:34,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:18:34,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:18:34,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:18:34,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:18:34,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:18:34,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:18:34,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:18:34,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:18:34,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:18:34,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:18:34,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:18:34,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:18:34,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:18:34,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:18:34,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:18:34,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:18:34,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:18:34,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:18:34,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:18:34,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:18:34,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:18:34,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:18:34,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:18:34,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:18:34,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:18:34,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:18:34,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:18:34,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:18:34,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:18:34,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:18:34,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:18:34,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:18:34,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:18:34,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:18:34,328 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 15:18:34,350 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:18:34,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:18:34,350 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:18:34,350 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:18:34,351 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:18:34,351 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:18:34,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:18:34,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:18:34,352 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:18:34,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:18:34,353 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:18:34,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:18:34,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:18:34,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:18:34,353 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 15:18:34,353 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:18:34,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 15:18:34,354 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:18:34,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 15:18:34,354 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:18:34,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 15:18:34,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:18:34,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:18:34,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:18:34,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:18:34,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:18:34,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:18:34,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 15:18:34,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:18:34,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:18:34,356 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:18:34,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 15:18:34,356 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:18:34,356 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:18:34,356 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:18:34,356 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_c7e82dee-9236-4560-98cf-04345930981a/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_c7e82dee-9236-4560-98cf-04345930981a/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 -> a145625a0fe2baedf73b7a84d58038ade27f8470c6f09a0f78d8ec75fe662acb [2022-12-13 15:18:34,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:18:34,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:18:34,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:18:34,558 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:18:34,558 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:18:34,559 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2022-12-13 15:18:37,171 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:18:37,311 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:18:37,311 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2022-12-13 15:18:37,319 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/data/90d516d8f/9a04458064ad4db78f8ba54dad6a9bee/FLAG7acbd29a9 [2022-12-13 15:18:37,332 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/data/90d516d8f/9a04458064ad4db78f8ba54dad6a9bee [2022-12-13 15:18:37,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:18:37,335 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:18:37,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:18:37,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:18:37,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:18:37,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1581006b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37, skipping insertion in model container [2022-12-13 15:18:37,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:18:37,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:18:37,485 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_c7e82dee-9236-4560-98cf-04345930981a/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[913,926] [2022-12-13 15:18:37,520 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_c7e82dee-9236-4560-98cf-04345930981a/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[5977,5990] [2022-12-13 15:18:37,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:18:37,562 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:18:37,572 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_c7e82dee-9236-4560-98cf-04345930981a/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[913,926] [2022-12-13 15:18:37,583 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_c7e82dee-9236-4560-98cf-04345930981a/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-2.c[5977,5990] [2022-12-13 15:18:37,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:18:37,612 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:18:37,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37 WrapperNode [2022-12-13 15:18:37,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:18:37,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:18:37,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:18:37,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:18:37,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,655 INFO L138 Inliner]: procedures = 52, calls = 55, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 480 [2022-12-13 15:18:37,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:18:37,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:18:37,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:18:37,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:18:37,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,669 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,685 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:18:37,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:18:37,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:18:37,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:18:37,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37" (1/1) ... [2022-12-13 15:18:37,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:18:37,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:18:37,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:18:37,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:18:37,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:18:37,754 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 15:18:37,754 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 15:18:37,754 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-12-13 15:18:37,754 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-12-13 15:18:37,754 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-13 15:18:37,754 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-13 15:18:37,755 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-13 15:18:37,755 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-13 15:18:37,755 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-13 15:18:37,755 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-13 15:18:37,755 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-13 15:18:37,755 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-13 15:18:37,755 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-13 15:18:37,756 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-13 15:18:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:18:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-13 15:18:37,756 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-13 15:18:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:18:37,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:18:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-13 15:18:37,757 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-13 15:18:37,757 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-12-13 15:18:37,757 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-12-13 15:18:37,842 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:18:37,845 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:18:38,207 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:18:38,216 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:18:38,217 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-13 15:18:38,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:18:38 BoogieIcfgContainer [2022-12-13 15:18:38,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:18:38,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:18:38,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:18:38,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:18:38,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:18:37" (1/3) ... [2022-12-13 15:18:38,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d7b5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:18:38, skipping insertion in model container [2022-12-13 15:18:38,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:18:37" (2/3) ... [2022-12-13 15:18:38,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d7b5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:18:38, skipping insertion in model container [2022-12-13 15:18:38,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:18:38" (3/3) ... [2022-12-13 15:18:38,228 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-2.c [2022-12-13 15:18:38,243 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:18:38,243 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 15:18:38,290 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:18:38,295 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;@d437e4a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:18:38,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 15:18:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 175 states have (on average 1.5771428571428572) internal successors, (276), 182 states have internal predecessors, (276), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-12-13 15:18:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-13 15:18:38,308 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:38,309 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] [2022-12-13 15:18:38,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:38,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2045589042, now seen corresponding path program 1 times [2022-12-13 15:18:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:38,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183759724] [2022-12-13 15:18:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:38,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:38,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:18:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:38,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 15:18:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:38,524 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 15:18:38,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:38,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183759724] [2022-12-13 15:18:38,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183759724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:38,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:18:38,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:18:38,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236407102] [2022-12-13 15:18:38,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:38,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:18:38,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:38,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:18:38,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:18:38,553 INFO L87 Difference]: Start difference. First operand has 212 states, 175 states have (on average 1.5771428571428572) internal successors, (276), 182 states have internal predecessors, (276), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:18:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:38,871 INFO L93 Difference]: Finished difference Result 478 states and 736 transitions. [2022-12-13 15:18:38,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:18:38,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-12-13 15:18:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:38,885 INFO L225 Difference]: With dead ends: 478 [2022-12-13 15:18:38,885 INFO L226 Difference]: Without dead ends: 271 [2022-12-13 15:18:38,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:18:38,893 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 357 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:38,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 477 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:18:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-12-13 15:18:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 265. [2022-12-13 15:18:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 224 states have (on average 1.4419642857142858) internal successors, (323), 229 states have internal predecessors, (323), 28 states have call successors, (28), 12 states have call predecessors, (28), 11 states have return successors, (30), 24 states have call predecessors, (30), 24 states have call successors, (30) [2022-12-13 15:18:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 381 transitions. [2022-12-13 15:18:38,956 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 381 transitions. Word has length 44 [2022-12-13 15:18:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:38,956 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 381 transitions. [2022-12-13 15:18:38,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:18:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 381 transitions. [2022-12-13 15:18:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 15:18:38,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:38,960 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] [2022-12-13 15:18:38,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 15:18:38,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash 899257869, now seen corresponding path program 1 times [2022-12-13 15:18:38,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:38,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270464671] [2022-12-13 15:18:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:38,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:18:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:39,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:18:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:39,046 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 15:18:39,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:39,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270464671] [2022-12-13 15:18:39,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270464671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:39,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:18:39,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:18:39,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504588085] [2022-12-13 15:18:39,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:39,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:18:39,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:18:39,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:18:39,050 INFO L87 Difference]: Start difference. First operand 265 states and 381 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:18:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:39,265 INFO L93 Difference]: Finished difference Result 513 states and 721 transitions. [2022-12-13 15:18:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:18:39,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-12-13 15:18:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:39,267 INFO L225 Difference]: With dead ends: 513 [2022-12-13 15:18:39,267 INFO L226 Difference]: Without dead ends: 389 [2022-12-13 15:18:39,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:18:39,271 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 170 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:39,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 606 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:18:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-12-13 15:18:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 332. [2022-12-13 15:18:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 285 states have (on average 1.4280701754385965) internal successors, (407), 290 states have internal predecessors, (407), 31 states have call successors, (31), 15 states have call predecessors, (31), 14 states have return successors, (33), 27 states have call predecessors, (33), 27 states have call successors, (33) [2022-12-13 15:18:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 471 transitions. [2022-12-13 15:18:39,316 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 471 transitions. Word has length 45 [2022-12-13 15:18:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:39,317 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 471 transitions. [2022-12-13 15:18:39,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:18:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 471 transitions. [2022-12-13 15:18:39,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 15:18:39,320 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:39,321 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] [2022-12-13 15:18:39,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 15:18:39,321 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:39,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:39,322 INFO L85 PathProgramCache]: Analyzing trace with hash -385099592, now seen corresponding path program 1 times [2022-12-13 15:18:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:39,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104673374] [2022-12-13 15:18:39,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:18:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:39,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 15:18:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:39,398 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 15:18:39,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:39,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104673374] [2022-12-13 15:18:39,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104673374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:39,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:18:39,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:18:39,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158281249] [2022-12-13 15:18:39,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:39,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:18:39,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:39,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:18:39,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:18:39,401 INFO L87 Difference]: Start difference. First operand 332 states and 471 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:18:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:39,606 INFO L93 Difference]: Finished difference Result 740 states and 1030 transitions. [2022-12-13 15:18:39,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:18:39,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-12-13 15:18:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:39,611 INFO L225 Difference]: With dead ends: 740 [2022-12-13 15:18:39,611 INFO L226 Difference]: Without dead ends: 549 [2022-12-13 15:18:39,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:18:39,613 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 366 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:39,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 468 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:18:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-12-13 15:18:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 497. [2022-12-13 15:18:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 431 states have (on average 1.3851508120649652) internal successors, (597), 439 states have internal predecessors, (597), 42 states have call successors, (42), 22 states have call predecessors, (42), 22 states have return successors, (50), 36 states have call predecessors, (50), 38 states have call successors, (50) [2022-12-13 15:18:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 689 transitions. [2022-12-13 15:18:39,638 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 689 transitions. Word has length 45 [2022-12-13 15:18:39,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:39,638 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 689 transitions. [2022-12-13 15:18:39,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 15:18:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 689 transitions. [2022-12-13 15:18:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-13 15:18:39,640 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:39,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:39,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 15:18:39,640 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:39,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:39,641 INFO L85 PathProgramCache]: Analyzing trace with hash -748902494, now seen corresponding path program 1 times [2022-12-13 15:18:39,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:39,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502527390] [2022-12-13 15:18:39,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:39,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:18:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-12-13 15:18:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:39,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:18:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 15:18:39,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:39,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502527390] [2022-12-13 15:18:39,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502527390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:39,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:18:39,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:18:39,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507402478] [2022-12-13 15:18:39,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:39,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:18:39,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:39,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:18:39,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:18:39,708 INFO L87 Difference]: Start difference. First operand 497 states and 689 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 15:18:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:39,929 INFO L93 Difference]: Finished difference Result 1081 states and 1474 transitions. [2022-12-13 15:18:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:18:39,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-12-13 15:18:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:39,934 INFO L225 Difference]: With dead ends: 1081 [2022-12-13 15:18:39,934 INFO L226 Difference]: Without dead ends: 725 [2022-12-13 15:18:39,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:18:39,937 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 154 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:39,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 658 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:18:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-12-13 15:18:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 687. [2022-12-13 15:18:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 597 states have (on average 1.3350083752093802) internal successors, (797), 607 states have internal predecessors, (797), 56 states have call successors, (56), 30 states have call predecessors, (56), 32 states have return successors, (74), 50 states have call predecessors, (74), 52 states have call successors, (74) [2022-12-13 15:18:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 927 transitions. [2022-12-13 15:18:39,984 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 927 transitions. Word has length 62 [2022-12-13 15:18:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:39,985 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 927 transitions. [2022-12-13 15:18:39,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 15:18:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 927 transitions. [2022-12-13 15:18:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 15:18:39,987 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:39,988 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:39,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 15:18:39,988 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:39,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash -80982464, now seen corresponding path program 1 times [2022-12-13 15:18:39,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:39,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837061435] [2022-12-13 15:18:39,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:39,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:18:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-12-13 15:18:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:40,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 15:18:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 15:18:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837061435] [2022-12-13 15:18:40,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837061435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:40,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:18:40,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:18:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337423807] [2022-12-13 15:18:40,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:40,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:18:40,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:40,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:18:40,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:18:40,054 INFO L87 Difference]: Start difference. First operand 687 states and 927 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 15:18:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:40,258 INFO L93 Difference]: Finished difference Result 1340 states and 1780 transitions. [2022-12-13 15:18:40,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:18:40,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-12-13 15:18:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:40,262 INFO L225 Difference]: With dead ends: 1340 [2022-12-13 15:18:40,262 INFO L226 Difference]: Without dead ends: 886 [2022-12-13 15:18:40,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:18:40,264 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 353 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:40,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 466 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:18:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-12-13 15:18:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 831. [2022-12-13 15:18:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 725 states have (on average 1.3075862068965518) internal successors, (948), 737 states have internal predecessors, (948), 64 states have call successors, (64), 36 states have call predecessors, (64), 40 states have return successors, (88), 58 states have call predecessors, (88), 60 states have call successors, (88) [2022-12-13 15:18:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1100 transitions. [2022-12-13 15:18:40,317 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1100 transitions. Word has length 67 [2022-12-13 15:18:40,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:40,318 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 1100 transitions. [2022-12-13 15:18:40,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 15:18:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1100 transitions. [2022-12-13 15:18:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 15:18:40,320 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:40,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:40,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 15:18:40,321 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:40,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash -294715005, now seen corresponding path program 1 times [2022-12-13 15:18:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:40,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931188663] [2022-12-13 15:18:40,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:40,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:40,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:18:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:40,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:18:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:18:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:18:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:18:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:40,427 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 15:18:40,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:40,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931188663] [2022-12-13 15:18:40,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931188663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:40,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:18:40,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:18:40,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906857076] [2022-12-13 15:18:40,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:40,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:18:40,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:40,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:18:40,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:18:40,430 INFO L87 Difference]: Start difference. First operand 831 states and 1100 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:41,118 INFO L93 Difference]: Finished difference Result 1141 states and 1571 transitions. [2022-12-13 15:18:41,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 15:18:41,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 15:18:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:41,123 INFO L225 Difference]: With dead ends: 1141 [2022-12-13 15:18:41,123 INFO L226 Difference]: Without dead ends: 1017 [2022-12-13 15:18:41,124 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 15:18:41,124 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 574 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:41,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 716 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 15:18:41,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2022-12-13 15:18:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 952. [2022-12-13 15:18:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 828 states have (on average 1.3333333333333333) internal successors, (1104), 841 states have internal predecessors, (1104), 75 states have call successors, (75), 42 states have call predecessors, (75), 47 states have return successors, (102), 69 states have call predecessors, (102), 71 states have call successors, (102) [2022-12-13 15:18:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1281 transitions. [2022-12-13 15:18:41,183 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1281 transitions. Word has length 69 [2022-12-13 15:18:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:41,183 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1281 transitions. [2022-12-13 15:18:41,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1281 transitions. [2022-12-13 15:18:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 15:18:41,185 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:41,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:41,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 15:18:41,185 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash -192000641, now seen corresponding path program 1 times [2022-12-13 15:18:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:41,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419077264] [2022-12-13 15:18:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:18:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:18:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:41,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:18:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:41,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:18:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:41,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:18:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:41,295 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 15:18:41,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:41,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419077264] [2022-12-13 15:18:41,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419077264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:41,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:18:41,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:18:41,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976709600] [2022-12-13 15:18:41,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:41,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:18:41,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:41,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:18:41,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:18:41,297 INFO L87 Difference]: Start difference. First operand 952 states and 1281 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:42,091 INFO L93 Difference]: Finished difference Result 1414 states and 1975 transitions. [2022-12-13 15:18:42,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 15:18:42,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 15:18:42,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:42,099 INFO L225 Difference]: With dead ends: 1414 [2022-12-13 15:18:42,099 INFO L226 Difference]: Without dead ends: 1169 [2022-12-13 15:18:42,101 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 15:18:42,102 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 567 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:42,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1168 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 15:18:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-12-13 15:18:42,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1066. [2022-12-13 15:18:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 924 states have (on average 1.3484848484848484) internal successors, (1246), 938 states have internal predecessors, (1246), 86 states have call successors, (86), 48 states have call predecessors, (86), 54 states have return successors, (115), 81 states have call predecessors, (115), 82 states have call successors, (115) [2022-12-13 15:18:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1447 transitions. [2022-12-13 15:18:42,194 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1447 transitions. Word has length 69 [2022-12-13 15:18:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:42,194 INFO L495 AbstractCegarLoop]: Abstraction has 1066 states and 1447 transitions. [2022-12-13 15:18:42,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1447 transitions. [2022-12-13 15:18:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 15:18:42,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:42,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:42,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 15:18:42,198 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:42,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:42,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1194784769, now seen corresponding path program 1 times [2022-12-13 15:18:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:42,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534925984] [2022-12-13 15:18:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:42,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:42,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:18:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:42,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:18:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:42,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:18:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:42,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:18:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:42,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:18:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:18:42,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:42,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534925984] [2022-12-13 15:18:42,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534925984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:42,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:18:42,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:18:42,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657097292] [2022-12-13 15:18:42,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:42,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:18:42,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:42,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:18:42,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:18:42,321 INFO L87 Difference]: Start difference. First operand 1066 states and 1447 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:43,001 INFO L93 Difference]: Finished difference Result 1815 states and 2569 transitions. [2022-12-13 15:18:43,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 15:18:43,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 15:18:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:43,006 INFO L225 Difference]: With dead ends: 1815 [2022-12-13 15:18:43,006 INFO L226 Difference]: Without dead ends: 1456 [2022-12-13 15:18:43,007 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 15:18:43,008 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 601 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:43,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 885 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 15:18:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-12-13 15:18:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1295. [2022-12-13 15:18:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1117 states have (on average 1.370635631154879) internal successors, (1531), 1133 states have internal predecessors, (1531), 108 states have call successors, (108), 60 states have call predecessors, (108), 68 states have return successors, (145), 105 states have call predecessors, (145), 104 states have call successors, (145) [2022-12-13 15:18:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1784 transitions. [2022-12-13 15:18:43,076 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1784 transitions. Word has length 69 [2022-12-13 15:18:43,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:43,076 INFO L495 AbstractCegarLoop]: Abstraction has 1295 states and 1784 transitions. [2022-12-13 15:18:43,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1784 transitions. [2022-12-13 15:18:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 15:18:43,078 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:43,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:43,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 15:18:43,079 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2070803775, now seen corresponding path program 1 times [2022-12-13 15:18:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:43,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060426856] [2022-12-13 15:18:43,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:43,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:43,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:18:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:18:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:18:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:43,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:18:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:43,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:18:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:43,165 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 15:18:43,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:43,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060426856] [2022-12-13 15:18:43,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060426856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:43,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:18:43,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:18:43,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290759590] [2022-12-13 15:18:43,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:43,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:18:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:43,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:18:43,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:18:43,168 INFO L87 Difference]: Start difference. First operand 1295 states and 1784 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:43,653 INFO L93 Difference]: Finished difference Result 2032 states and 2897 transitions. [2022-12-13 15:18:43,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:18:43,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 15:18:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:43,660 INFO L225 Difference]: With dead ends: 2032 [2022-12-13 15:18:43,660 INFO L226 Difference]: Without dead ends: 1444 [2022-12-13 15:18:43,662 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 15:18:43,663 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 474 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:43,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 714 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 15:18:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-12-13 15:18:43,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1295. [2022-12-13 15:18:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1117 states have (on average 1.3661593554162936) internal successors, (1526), 1133 states have internal predecessors, (1526), 108 states have call successors, (108), 60 states have call predecessors, (108), 68 states have return successors, (145), 105 states have call predecessors, (145), 104 states have call successors, (145) [2022-12-13 15:18:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1779 transitions. [2022-12-13 15:18:43,741 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1779 transitions. Word has length 69 [2022-12-13 15:18:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:43,741 INFO L495 AbstractCegarLoop]: Abstraction has 1295 states and 1779 transitions. [2022-12-13 15:18:43,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1779 transitions. [2022-12-13 15:18:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 15:18:43,742 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:43,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:43,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 15:18:43,743 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1780262847, now seen corresponding path program 1 times [2022-12-13 15:18:43,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:43,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243664901] [2022-12-13 15:18:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:43,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:43,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:18:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:43,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:18:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:43,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:18:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:43,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:18:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:43,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:18:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:43,826 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 15:18:43,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:43,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243664901] [2022-12-13 15:18:43,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243664901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:43,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:18:43,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:18:43,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003948537] [2022-12-13 15:18:43,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:43,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:18:43,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:43,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:18:43,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:18:43,827 INFO L87 Difference]: Start difference. First operand 1295 states and 1779 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:44,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:44,631 INFO L93 Difference]: Finished difference Result 2685 states and 3828 transitions. [2022-12-13 15:18:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 15:18:44,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 15:18:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:44,637 INFO L225 Difference]: With dead ends: 2685 [2022-12-13 15:18:44,637 INFO L226 Difference]: Without dead ends: 2097 [2022-12-13 15:18:44,639 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 15:18:44,639 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 563 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:44,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1152 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 15:18:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2022-12-13 15:18:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 1706. [2022-12-13 15:18:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1460 states have (on average 1.3815068493150684) internal successors, (2017), 1480 states have internal predecessors, (2017), 148 states have call successors, (148), 84 states have call predecessors, (148), 96 states have return successors, (207), 149 states have call predecessors, (207), 144 states have call successors, (207) [2022-12-13 15:18:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2372 transitions. [2022-12-13 15:18:44,738 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2372 transitions. Word has length 69 [2022-12-13 15:18:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:44,738 INFO L495 AbstractCegarLoop]: Abstraction has 1706 states and 2372 transitions. [2022-12-13 15:18:44,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2372 transitions. [2022-12-13 15:18:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 15:18:44,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:44,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:44,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 15:18:44,740 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:44,741 INFO L85 PathProgramCache]: Analyzing trace with hash -241922817, now seen corresponding path program 1 times [2022-12-13 15:18:44,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:44,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230828523] [2022-12-13 15:18:44,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:44,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:44,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:18:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:44,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:18:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:44,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:18:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:18:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:18:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:44,819 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 15:18:44,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:44,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230828523] [2022-12-13 15:18:44,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230828523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:44,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:18:44,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:18:44,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568183762] [2022-12-13 15:18:44,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:44,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:18:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:44,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:18:44,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:18:44,821 INFO L87 Difference]: Start difference. First operand 1706 states and 2372 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:45,686 INFO L93 Difference]: Finished difference Result 4076 states and 5836 transitions. [2022-12-13 15:18:45,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 15:18:45,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 15:18:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:45,694 INFO L225 Difference]: With dead ends: 4076 [2022-12-13 15:18:45,695 INFO L226 Difference]: Without dead ends: 3077 [2022-12-13 15:18:45,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-12-13 15:18:45,697 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 564 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:45,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1156 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 15:18:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2022-12-13 15:18:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2560. [2022-12-13 15:18:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 2182 states have (on average 1.4055912007332723) internal successors, (3067), 2210 states have internal predecessors, (3067), 224 states have call successors, (224), 132 states have call predecessors, (224), 152 states have return successors, (345), 233 states have call predecessors, (345), 220 states have call successors, (345) [2022-12-13 15:18:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3636 transitions. [2022-12-13 15:18:45,845 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3636 transitions. Word has length 69 [2022-12-13 15:18:45,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:45,846 INFO L495 AbstractCegarLoop]: Abstraction has 2560 states and 3636 transitions. [2022-12-13 15:18:45,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3636 transitions. [2022-12-13 15:18:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 15:18:45,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:45,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:45,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 15:18:45,848 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:45,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2024458369, now seen corresponding path program 1 times [2022-12-13 15:18:45,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:45,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984255667] [2022-12-13 15:18:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:45,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:45,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:18:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:45,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:18:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:45,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:18:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:18:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:45,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:18:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:45,910 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 15:18:45,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:45,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984255667] [2022-12-13 15:18:45,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984255667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:45,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:18:45,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:18:45,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425234467] [2022-12-13 15:18:45,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:45,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:18:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:45,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:18:45,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:18:45,912 INFO L87 Difference]: Start difference. First operand 2560 states and 3636 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:46,680 INFO L93 Difference]: Finished difference Result 5934 states and 8606 transitions. [2022-12-13 15:18:46,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 15:18:46,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-12-13 15:18:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:46,692 INFO L225 Difference]: With dead ends: 5934 [2022-12-13 15:18:46,692 INFO L226 Difference]: Without dead ends: 4082 [2022-12-13 15:18:46,695 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 15:18:46,696 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 700 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:46,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 846 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 15:18:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4082 states. [2022-12-13 15:18:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4082 to 3500. [2022-12-13 15:18:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 2964 states have (on average 1.4021592442645074) internal successors, (4156), 3009 states have internal predecessors, (4156), 320 states have call successors, (320), 186 states have call predecessors, (320), 214 states have return successors, (469), 320 states have call predecessors, (469), 316 states have call successors, (469) [2022-12-13 15:18:46,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 4945 transitions. [2022-12-13 15:18:46,902 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 4945 transitions. Word has length 69 [2022-12-13 15:18:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:46,902 INFO L495 AbstractCegarLoop]: Abstraction has 3500 states and 4945 transitions. [2022-12-13 15:18:46,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 15:18:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 4945 transitions. [2022-12-13 15:18:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 15:18:46,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:46,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:46,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 15:18:46,905 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash 688510564, now seen corresponding path program 1 times [2022-12-13 15:18:46,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:46,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984405283] [2022-12-13 15:18:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:46,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:18:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 15:18:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:46,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:18:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 15:18:46,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:46,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984405283] [2022-12-13 15:18:46,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984405283] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:18:46,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919960925] [2022-12-13 15:18:46,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:46,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:18:46,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:18:46,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:18:46,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 15:18:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:47,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:18:47,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:18:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 15:18:47,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:18:47,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919960925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:47,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:18:47,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-13 15:18:47,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469339340] [2022-12-13 15:18:47,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:47,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:18:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:47,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:18:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:18:47,069 INFO L87 Difference]: Start difference. First operand 3500 states and 4945 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 15:18:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:47,407 INFO L93 Difference]: Finished difference Result 4043 states and 5668 transitions. [2022-12-13 15:18:47,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:18:47,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2022-12-13 15:18:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:47,415 INFO L225 Difference]: With dead ends: 4043 [2022-12-13 15:18:47,416 INFO L226 Difference]: Without dead ends: 3498 [2022-12-13 15:18:47,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:18:47,418 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 72 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:47,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 600 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:18:47,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2022-12-13 15:18:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3454. [2022-12-13 15:18:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2924 states have (on average 1.3991108071135432) internal successors, (4091), 2969 states have internal predecessors, (4091), 316 states have call successors, (316), 184 states have call predecessors, (316), 212 states have return successors, (463), 316 states have call predecessors, (463), 312 states have call successors, (463) [2022-12-13 15:18:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4870 transitions. [2022-12-13 15:18:47,642 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4870 transitions. Word has length 68 [2022-12-13 15:18:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:47,642 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4870 transitions. [2022-12-13 15:18:47,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 15:18:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4870 transitions. [2022-12-13 15:18:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-13 15:18:47,645 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:47,645 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 15:18:47,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 15:18:47,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 15:18:47,846 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:47,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1426484957, now seen corresponding path program 1 times [2022-12-13 15:18:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:47,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737492156] [2022-12-13 15:18:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:47,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:18:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:47,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 15:18:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:48,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:18:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 15:18:48,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:48,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737492156] [2022-12-13 15:18:48,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737492156] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:18:48,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834903515] [2022-12-13 15:18:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:48,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:18:48,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:18:48,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:18:48,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 15:18:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:48,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:18:48,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:18:48,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:18:48,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:18:48,162 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 15:18:48,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834903515] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 15:18:48,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 15:18:48,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-12-13 15:18:48,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005710725] [2022-12-13 15:18:48,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:48,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:18:48,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:48,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:18:48,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:18:48,164 INFO L87 Difference]: Start difference. First operand 3454 states and 4870 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 15:18:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:48,465 INFO L93 Difference]: Finished difference Result 3506 states and 4932 transitions. [2022-12-13 15:18:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:18:48,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-12-13 15:18:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:48,475 INFO L225 Difference]: With dead ends: 3506 [2022-12-13 15:18:48,475 INFO L226 Difference]: Without dead ends: 3503 [2022-12-13 15:18:48,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:18:48,477 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 493 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:48,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 376 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:18:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2022-12-13 15:18:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3453. [2022-12-13 15:18:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3453 states, 2924 states have (on average 1.3984268125854993) internal successors, (4089), 2968 states have internal predecessors, (4089), 315 states have call successors, (315), 184 states have call predecessors, (315), 212 states have return successors, (463), 316 states have call predecessors, (463), 312 states have call successors, (463) [2022-12-13 15:18:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3453 states to 3453 states and 4867 transitions. [2022-12-13 15:18:48,699 INFO L78 Accepts]: Start accepts. Automaton has 3453 states and 4867 transitions. Word has length 68 [2022-12-13 15:18:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:48,699 INFO L495 AbstractCegarLoop]: Abstraction has 3453 states and 4867 transitions. [2022-12-13 15:18:48,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 15:18:48,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3453 states and 4867 transitions. [2022-12-13 15:18:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 15:18:48,701 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:48,701 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:48,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 15:18:48,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 15:18:48,902 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:48,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1272047869, now seen corresponding path program 1 times [2022-12-13 15:18:48,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:48,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344548401] [2022-12-13 15:18:48,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:48,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:18:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 15:18:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:49,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-12-13 15:18:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 15:18:49,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:49,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344548401] [2022-12-13 15:18:49,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344548401] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:18:49,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692396168] [2022-12-13 15:18:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:49,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:18:49,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:18:49,075 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:18:49,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 15:18:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:49,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 15:18:49,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:18:49,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:18:49,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:18:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 15:18:49,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692396168] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:18:49,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:18:49,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-12-13 15:18:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831870329] [2022-12-13 15:18:49,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:18:49,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 15:18:49,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:49,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 15:18:49,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 15:18:49,347 INFO L87 Difference]: Start difference. First operand 3453 states and 4867 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-13 15:18:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:50,553 INFO L93 Difference]: Finished difference Result 4963 states and 6805 transitions. [2022-12-13 15:18:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-13 15:18:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-12-13 15:18:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:50,563 INFO L225 Difference]: With dead ends: 4963 [2022-12-13 15:18:50,563 INFO L226 Difference]: Without dead ends: 4467 [2022-12-13 15:18:50,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-12-13 15:18:50,566 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 635 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:50,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 2438 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 15:18:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2022-12-13 15:18:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 3832. [2022-12-13 15:18:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3832 states, 3264 states have (on average 1.3789828431372548) internal successors, (4501), 3316 states have internal predecessors, (4501), 335 states have call successors, (335), 198 states have call predecessors, (335), 231 states have return successors, (497), 333 states have call predecessors, (497), 332 states have call successors, (497) [2022-12-13 15:18:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 5333 transitions. [2022-12-13 15:18:50,853 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 5333 transitions. Word has length 69 [2022-12-13 15:18:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:50,853 INFO L495 AbstractCegarLoop]: Abstraction has 3832 states and 5333 transitions. [2022-12-13 15:18:50,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-12-13 15:18:50,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 5333 transitions. [2022-12-13 15:18:50,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-13 15:18:50,864 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:50,865 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-13 15:18:50,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 15:18:51,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:18:51,066 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:51,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash -290000336, now seen corresponding path program 1 times [2022-12-13 15:18:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:51,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851031134] [2022-12-13 15:18:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:18:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:51,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 15:18:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 15:18:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:51,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 15:18:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 15:18:51,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:51,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851031134] [2022-12-13 15:18:51,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851031134] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:18:51,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684375315] [2022-12-13 15:18:51,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:51,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:18:51,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:18:51,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:18:51,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 15:18:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:51,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:18:51,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:18:51,233 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-13 15:18:51,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:18:51,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684375315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:51,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:18:51,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-13 15:18:51,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652193256] [2022-12-13 15:18:51,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:51,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:18:51,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:51,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:18:51,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:18:51,235 INFO L87 Difference]: Start difference. First operand 3832 states and 5333 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 15:18:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:51,490 INFO L93 Difference]: Finished difference Result 4523 states and 6208 transitions. [2022-12-13 15:18:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:18:51,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2022-12-13 15:18:51,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:51,502 INFO L225 Difference]: With dead ends: 4523 [2022-12-13 15:18:51,502 INFO L226 Difference]: Without dead ends: 3754 [2022-12-13 15:18:51,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:18:51,504 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 247 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 15:18:51,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 391 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:18:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2022-12-13 15:18:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3745. [2022-12-13 15:18:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3745 states, 3187 states have (on average 1.3796673988076562) internal successors, (4397), 3238 states have internal predecessors, (4397), 331 states have call successors, (331), 194 states have call predecessors, (331), 225 states have return successors, (489), 328 states have call predecessors, (489), 328 states have call successors, (489) [2022-12-13 15:18:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3745 states to 3745 states and 5217 transitions. [2022-12-13 15:18:51,749 INFO L78 Accepts]: Start accepts. Automaton has 3745 states and 5217 transitions. Word has length 88 [2022-12-13 15:18:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:51,749 INFO L495 AbstractCegarLoop]: Abstraction has 3745 states and 5217 transitions. [2022-12-13 15:18:51,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 15:18:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3745 states and 5217 transitions. [2022-12-13 15:18:51,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-13 15:18:51,754 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:51,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 15:18:51,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 15:18:51,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 15:18:51,955 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:51,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:51,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1575033221, now seen corresponding path program 1 times [2022-12-13 15:18:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:51,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431856332] [2022-12-13 15:18:51,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 15:18:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:51,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-12-13 15:18:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-12-13 15:18:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-12-13 15:18:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 15:18:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 15:18:52,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:52,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431856332] [2022-12-13 15:18:52,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431856332] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:18:52,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701379970] [2022-12-13 15:18:52,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:52,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:18:52,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:18:52,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:18:52,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 15:18:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:18:52,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:18:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 15:18:52,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:18:52,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701379970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:52,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:18:52,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-13 15:18:52,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179387352] [2022-12-13 15:18:52,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:52,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:18:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:52,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:18:52,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:18:52,107 INFO L87 Difference]: Start difference. First operand 3745 states and 5217 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 15:18:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:52,348 INFO L93 Difference]: Finished difference Result 4122 states and 5678 transitions. [2022-12-13 15:18:52,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:18:52,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2022-12-13 15:18:52,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:52,356 INFO L225 Difference]: With dead ends: 4122 [2022-12-13 15:18:52,356 INFO L226 Difference]: Without dead ends: 2804 [2022-12-13 15:18:52,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:18:52,358 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 61 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 595 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 15:18:52,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 595 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:18:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2022-12-13 15:18:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2804. [2022-12-13 15:18:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2804 states, 2349 states have (on average 1.4355044699872286) internal successors, (3372), 2384 states have internal predecessors, (3372), 274 states have call successors, (274), 157 states have call predecessors, (274), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2022-12-13 15:18:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 4043 transitions. [2022-12-13 15:18:52,522 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 4043 transitions. Word has length 103 [2022-12-13 15:18:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:52,523 INFO L495 AbstractCegarLoop]: Abstraction has 2804 states and 4043 transitions. [2022-12-13 15:18:52,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 15:18:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 4043 transitions. [2022-12-13 15:18:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-13 15:18:52,526 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:52,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:52,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 15:18:52,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 15:18:52,727 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:52,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:52,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1375832156, now seen corresponding path program 1 times [2022-12-13 15:18:52,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:52,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263667452] [2022-12-13 15:18:52,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:52,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:18:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:18:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:18:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:18:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:18:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 15:18:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:18:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 15:18:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 15:18:52,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:52,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263667452] [2022-12-13 15:18:52,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263667452] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:18:52,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136695658] [2022-12-13 15:18:52,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:52,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:18:52,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:18:52,821 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:18:52,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 15:18:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:52,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:18:52,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:18:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 15:18:52,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:18:52,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136695658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:52,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:18:52,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 15:18:52,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552753681] [2022-12-13 15:18:52,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:52,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:18:52,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:52,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:18:52,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:18:52,943 INFO L87 Difference]: Start difference. First operand 2804 states and 4043 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 15:18:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:53,248 INFO L93 Difference]: Finished difference Result 8245 states and 11965 transitions. [2022-12-13 15:18:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:18:53,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 111 [2022-12-13 15:18:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:53,258 INFO L225 Difference]: With dead ends: 8245 [2022-12-13 15:18:53,258 INFO L226 Difference]: Without dead ends: 5453 [2022-12-13 15:18:53,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:18:53,263 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 152 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 374 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 15:18:53,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 374 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:18:53,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5453 states. [2022-12-13 15:18:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5453 to 5397. [2022-12-13 15:18:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5397 states, 4528 states have (on average 1.4339664310954063) internal successors, (6493), 4596 states have internal predecessors, (6493), 512 states have call successors, (512), 309 states have call predecessors, (512), 356 states have return successors, (745), 507 states have call predecessors, (745), 510 states have call successors, (745) [2022-12-13 15:18:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5397 states to 5397 states and 7750 transitions. [2022-12-13 15:18:53,605 INFO L78 Accepts]: Start accepts. Automaton has 5397 states and 7750 transitions. Word has length 111 [2022-12-13 15:18:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:53,605 INFO L495 AbstractCegarLoop]: Abstraction has 5397 states and 7750 transitions. [2022-12-13 15:18:53,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 15:18:53,605 INFO L276 IsEmpty]: Start isEmpty. Operand 5397 states and 7750 transitions. [2022-12-13 15:18:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-13 15:18:53,612 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:53,612 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:18:53,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 15:18:53,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 15:18:53,813 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash 483275324, now seen corresponding path program 1 times [2022-12-13 15:18:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:53,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279954609] [2022-12-13 15:18:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:53,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:18:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:53,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:18:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:53,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:18:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:53,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:18:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:53,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:18:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:53,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 15:18:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:53,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:18:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:53,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 15:18:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 15:18:53,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:53,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279954609] [2022-12-13 15:18:53,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279954609] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:18:53,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391915556] [2022-12-13 15:18:53,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:53,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:18:53,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:18:53,911 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:18:53,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 15:18:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:53,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:18:53,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:18:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 15:18:54,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:18:54,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391915556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:54,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:18:54,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:18:54,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718186868] [2022-12-13 15:18:54,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:54,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:18:54,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:54,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:18:54,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:18:54,006 INFO L87 Difference]: Start difference. First operand 5397 states and 7750 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:18:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:54,636 INFO L93 Difference]: Finished difference Result 15785 states and 22914 transitions. [2022-12-13 15:18:54,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:18:54,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2022-12-13 15:18:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:54,662 INFO L225 Difference]: With dead ends: 15785 [2022-12-13 15:18:54,662 INFO L226 Difference]: Without dead ends: 10401 [2022-12-13 15:18:54,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:18:54,670 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 153 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 544 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 15:18:54,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 544 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:18:54,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10401 states. [2022-12-13 15:18:55,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10401 to 10401. [2022-12-13 15:18:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10401 states, 8719 states have (on average 1.4182819130634248) internal successors, (12366), 8836 states have internal predecessors, (12366), 977 states have call successors, (977), 609 states have call predecessors, (977), 704 states have return successors, (1596), 987 states have call predecessors, (1596), 975 states have call successors, (1596) [2022-12-13 15:18:55,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10401 states to 10401 states and 14939 transitions. [2022-12-13 15:18:55,407 INFO L78 Accepts]: Start accepts. Automaton has 10401 states and 14939 transitions. Word has length 111 [2022-12-13 15:18:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:55,408 INFO L495 AbstractCegarLoop]: Abstraction has 10401 states and 14939 transitions. [2022-12-13 15:18:55,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:18:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 10401 states and 14939 transitions. [2022-12-13 15:18:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-12-13 15:18:55,434 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:55,434 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 15:18:55,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 15:18:55,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:18:55,635 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:55,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash 142639029, now seen corresponding path program 1 times [2022-12-13 15:18:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:55,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682329944] [2022-12-13 15:18:55,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:55,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:55,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:18:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:55,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:18:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:55,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:18:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:55,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:18:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:18:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:55,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 15:18:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:55,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:18:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:55,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 15:18:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:55,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:18:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:55,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 15:18:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-13 15:18:55,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:55,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682329944] [2022-12-13 15:18:55,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682329944] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:18:55,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401920264] [2022-12-13 15:18:55,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:55,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:18:55,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:18:55,732 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:18:55,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 15:18:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:55,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:18:55,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:18:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 15:18:55,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:18:55,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401920264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:55,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:18:55,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 15:18:55,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222943942] [2022-12-13 15:18:55,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:55,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:18:55,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:55,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:18:55,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:18:55,911 INFO L87 Difference]: Start difference. First operand 10401 states and 14939 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 15:18:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:18:57,105 INFO L93 Difference]: Finished difference Result 30737 states and 44476 transitions. [2022-12-13 15:18:57,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:18:57,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2022-12-13 15:18:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:18:57,152 INFO L225 Difference]: With dead ends: 30737 [2022-12-13 15:18:57,152 INFO L226 Difference]: Without dead ends: 20353 [2022-12-13 15:18:57,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:18:57,171 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 110 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 395 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 15:18:57,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 395 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:18:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20353 states. [2022-12-13 15:18:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20353 to 20141. [2022-12-13 15:18:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20141 states, 16879 states have (on average 1.4133538716748621) internal successors, (23856), 17110 states have internal predecessors, (23856), 1871 states have call successors, (1871), 1199 states have call predecessors, (1871), 1390 states have return successors, (3038), 1863 states have call predecessors, (3038), 1869 states have call successors, (3038) [2022-12-13 15:18:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20141 states to 20141 states and 28765 transitions. [2022-12-13 15:18:58,840 INFO L78 Accepts]: Start accepts. Automaton has 20141 states and 28765 transitions. Word has length 143 [2022-12-13 15:18:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:18:58,841 INFO L495 AbstractCegarLoop]: Abstraction has 20141 states and 28765 transitions. [2022-12-13 15:18:58,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 15:18:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 20141 states and 28765 transitions. [2022-12-13 15:18:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-13 15:18:58,867 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:18:58,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, 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 15:18:58,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 15:18:59,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:18:59,069 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:18:59,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:18:59,070 INFO L85 PathProgramCache]: Analyzing trace with hash 28732006, now seen corresponding path program 1 times [2022-12-13 15:18:59,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:18:59,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705347614] [2022-12-13 15:18:59,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:59,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:18:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:18:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:18:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:18:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:18:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:18:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 15:18:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 15:18:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:18:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 15:18:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:18:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 15:18:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 15:18:59,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:18:59,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705347614] [2022-12-13 15:18:59,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705347614] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:18:59,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331478899] [2022-12-13 15:18:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:18:59,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:18:59,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:18:59,183 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:18:59,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 15:18:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:18:59,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:18:59,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:18:59,336 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 15:18:59,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:18:59,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331478899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:18:59,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:18:59,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:18:59,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439106289] [2022-12-13 15:18:59,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:18:59,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:18:59,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:18:59,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:18:59,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:18:59,338 INFO L87 Difference]: Start difference. First operand 20141 states and 28765 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 15:19:01,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:19:01,114 INFO L93 Difference]: Finished difference Result 42657 states and 61614 transitions. [2022-12-13 15:19:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:19:01,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-12-13 15:19:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:19:01,172 INFO L225 Difference]: With dead ends: 42657 [2022-12-13 15:19:01,173 INFO L226 Difference]: Without dead ends: 22535 [2022-12-13 15:19:01,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:01,199 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 130 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 226 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 15:19:01,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 226 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:19:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22535 states. [2022-12-13 15:19:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22535 to 22535. [2022-12-13 15:19:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22535 states, 19061 states have (on average 1.3748491684591575) internal successors, (26206), 19292 states have internal predecessors, (26206), 1925 states have call successors, (1925), 1357 states have call predecessors, (1925), 1548 states have return successors, (3106), 1917 states have call predecessors, (3106), 1923 states have call successors, (3106) [2022-12-13 15:19:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22535 states to 22535 states and 31237 transitions. [2022-12-13 15:19:02,733 INFO L78 Accepts]: Start accepts. Automaton has 22535 states and 31237 transitions. Word has length 160 [2022-12-13 15:19:02,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:19:02,733 INFO L495 AbstractCegarLoop]: Abstraction has 22535 states and 31237 transitions. [2022-12-13 15:19:02,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 15:19:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand 22535 states and 31237 transitions. [2022-12-13 15:19:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-13 15:19:02,764 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:19:02,764 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, 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] [2022-12-13 15:19:02,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 15:19:02,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 15:19:02,965 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:19:02,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash -124896125, now seen corresponding path program 1 times [2022-12-13 15:19:02,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:02,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630365760] [2022-12-13 15:19:02,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:02,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:19:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:19:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:19:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:19:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:19:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-12-13 15:19:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 15:19:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 15:19:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-12-13 15:19:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-13 15:19:03,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:19:03,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630365760] [2022-12-13 15:19:03,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630365760] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:19:03,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727789683] [2022-12-13 15:19:03,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:03,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:19:03,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:19:03,081 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:19:03,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 15:19:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:03,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:19:03,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:19:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-12-13 15:19:03,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:19:03,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727789683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:19:03,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:19:03,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:19:03,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002516787] [2022-12-13 15:19:03,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:19:03,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:19:03,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:19:03,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:19:03,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:03,193 INFO L87 Difference]: Start difference. First operand 22535 states and 31237 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 15:19:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:19:05,225 INFO L93 Difference]: Finished difference Result 39568 states and 54775 transitions. [2022-12-13 15:19:05,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:19:05,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 160 [2022-12-13 15:19:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:19:05,270 INFO L225 Difference]: With dead ends: 39568 [2022-12-13 15:19:05,270 INFO L226 Difference]: Without dead ends: 24075 [2022-12-13 15:19:05,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:05,288 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 131 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 392 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 15:19:05,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 392 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:19:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24075 states. [2022-12-13 15:19:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24075 to 23935. [2022-12-13 15:19:06,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23935 states, 20349 states have (on average 1.350140056022409) internal successors, (27474), 20580 states have internal predecessors, (27474), 1945 states have call successors, (1945), 1449 states have call predecessors, (1945), 1640 states have return successors, (3218), 1937 states have call predecessors, (3218), 1943 states have call successors, (3218) [2022-12-13 15:19:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23935 states to 23935 states and 32637 transitions. [2022-12-13 15:19:06,945 INFO L78 Accepts]: Start accepts. Automaton has 23935 states and 32637 transitions. Word has length 160 [2022-12-13 15:19:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:19:06,946 INFO L495 AbstractCegarLoop]: Abstraction has 23935 states and 32637 transitions. [2022-12-13 15:19:06,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 15:19:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 23935 states and 32637 transitions. [2022-12-13 15:19:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 15:19:06,972 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:19:06,972 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, 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 15:19:06,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 15:19:07,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 15:19:07,174 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:19:07,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:07,175 INFO L85 PathProgramCache]: Analyzing trace with hash -402645848, now seen corresponding path program 1 times [2022-12-13 15:19:07,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:07,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523364100] [2022-12-13 15:19:07,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:19:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:19:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:19:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:19:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:19:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 15:19:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 15:19:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 15:19:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 15:19:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-13 15:19:07,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:19:07,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523364100] [2022-12-13 15:19:07,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523364100] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:19:07,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002910501] [2022-12-13 15:19:07,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:07,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:19:07,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:19:07,272 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:19:07,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 15:19:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:07,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:19:07,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:19:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-13 15:19:07,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:19:07,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002910501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:19:07,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:19:07,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:19:07,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933925434] [2022-12-13 15:19:07,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:19:07,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:19:07,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:19:07,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:19:07,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:07,377 INFO L87 Difference]: Start difference. First operand 23935 states and 32637 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 15:19:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:19:10,845 INFO L93 Difference]: Finished difference Result 70545 states and 97151 transitions. [2022-12-13 15:19:10,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:19:10,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 161 [2022-12-13 15:19:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:19:10,942 INFO L225 Difference]: With dead ends: 70545 [2022-12-13 15:19:10,942 INFO L226 Difference]: Without dead ends: 46629 [2022-12-13 15:19:10,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:10,978 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 163 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 553 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 15:19:10,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 553 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:19:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46629 states. [2022-12-13 15:19:14,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46629 to 46585. [2022-12-13 15:19:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46585 states, 39585 states have (on average 1.338890994063408) internal successors, (53000), 40046 states have internal predecessors, (53000), 3775 states have call successors, (3775), 2841 states have call predecessors, (3775), 3224 states have return successors, (7134), 3761 states have call predecessors, (7134), 3773 states have call successors, (7134) [2022-12-13 15:19:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46585 states to 46585 states and 63909 transitions. [2022-12-13 15:19:14,368 INFO L78 Accepts]: Start accepts. Automaton has 46585 states and 63909 transitions. Word has length 161 [2022-12-13 15:19:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:19:14,368 INFO L495 AbstractCegarLoop]: Abstraction has 46585 states and 63909 transitions. [2022-12-13 15:19:14,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 15:19:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 46585 states and 63909 transitions. [2022-12-13 15:19:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 15:19:14,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:19:14,426 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] [2022-12-13 15:19:14,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 15:19:14,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:19:14,627 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:19:14,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1546394152, now seen corresponding path program 1 times [2022-12-13 15:19:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:14,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41491756] [2022-12-13 15:19:14,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:14,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:19:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:19:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:19:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:19:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:19:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 15:19:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 15:19:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 15:19:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 15:19:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 15:19:14,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:19:14,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41491756] [2022-12-13 15:19:14,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41491756] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:19:14,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756460488] [2022-12-13 15:19:14,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:14,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:19:14,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:19:14,758 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:19:14,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 15:19:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:14,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:19:14,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:19:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 15:19:14,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:19:14,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756460488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:19:14,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:19:14,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:19:14,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045471807] [2022-12-13 15:19:14,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:19:14,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:19:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:19:14,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:19:14,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:14,896 INFO L87 Difference]: Start difference. First operand 46585 states and 63909 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 15:19:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:19:18,101 INFO L93 Difference]: Finished difference Result 76949 states and 107564 transitions. [2022-12-13 15:19:18,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:19:18,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 161 [2022-12-13 15:19:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:19:18,183 INFO L225 Difference]: With dead ends: 76949 [2022-12-13 15:19:18,183 INFO L226 Difference]: Without dead ends: 39401 [2022-12-13 15:19:18,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:18,234 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 125 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 224 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 15:19:18,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 224 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:19:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39401 states. [2022-12-13 15:19:20,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39401 to 28185. [2022-12-13 15:19:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28185 states, 24009 states have (on average 1.2966804115123496) internal successors, (31132), 24250 states have internal predecessors, (31132), 2255 states have call successors, (2255), 1729 states have call predecessors, (2255), 1920 states have return successors, (3778), 2237 states have call predecessors, (3778), 2253 states have call successors, (3778) [2022-12-13 15:19:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28185 states to 28185 states and 37165 transitions. [2022-12-13 15:19:20,716 INFO L78 Accepts]: Start accepts. Automaton has 28185 states and 37165 transitions. Word has length 161 [2022-12-13 15:19:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:19:20,716 INFO L495 AbstractCegarLoop]: Abstraction has 28185 states and 37165 transitions. [2022-12-13 15:19:20,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 15:19:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 28185 states and 37165 transitions. [2022-12-13 15:19:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 15:19:20,742 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:19:20,742 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:19:20,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 15:19:20,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:19:20,943 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:19:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:20,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1993102869, now seen corresponding path program 1 times [2022-12-13 15:19:20,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:20,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974443499] [2022-12-13 15:19:20,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:20,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:20,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:19:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:20,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:19:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:20,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:19:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:21,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:19:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:21,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:19:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:21,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 15:19:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:21,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:21,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-12-13 15:19:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 15:19:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:21,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 15:19:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-12-13 15:19:21,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:19:21,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974443499] [2022-12-13 15:19:21,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974443499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:19:21,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303852580] [2022-12-13 15:19:21,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:21,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:19:21,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:19:21,041 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:19:21,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 15:19:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:21,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:19:21,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:19:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 15:19:21,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:19:21,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303852580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:19:21,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:19:21,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:19:21,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019308355] [2022-12-13 15:19:21,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:19:21,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:19:21,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:19:21,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:19:21,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:21,139 INFO L87 Difference]: Start difference. First operand 28185 states and 37165 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 15:19:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:19:25,315 INFO L93 Difference]: Finished difference Result 80093 states and 106937 transitions. [2022-12-13 15:19:25,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:19:25,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2022-12-13 15:19:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:19:25,430 INFO L225 Difference]: With dead ends: 80093 [2022-12-13 15:19:25,430 INFO L226 Difference]: Without dead ends: 51937 [2022-12-13 15:19:25,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:25,469 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 150 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 544 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 15:19:25,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 544 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:19:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51937 states. [2022-12-13 15:19:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51937 to 51933. [2022-12-13 15:19:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51933 states, 44065 states have (on average 1.2859185294451378) internal successors, (56664), 44546 states have internal predecessors, (56664), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2022-12-13 15:19:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51933 states to 51933 states and 69131 transitions. [2022-12-13 15:19:29,714 INFO L78 Accepts]: Start accepts. Automaton has 51933 states and 69131 transitions. Word has length 161 [2022-12-13 15:19:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:19:29,714 INFO L495 AbstractCegarLoop]: Abstraction has 51933 states and 69131 transitions. [2022-12-13 15:19:29,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 15:19:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 51933 states and 69131 transitions. [2022-12-13 15:19:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 15:19:29,759 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:19:29,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:29,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 15:19:29,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 15:19:29,961 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:19:29,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash -129116033, now seen corresponding path program 1 times [2022-12-13 15:19:29,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:29,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354821801] [2022-12-13 15:19:29,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:29,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:29,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:19:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:30,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:19:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:30,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:19:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:30,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:19:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:30,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:19:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:30,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 15:19:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:30,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 15:19:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:30,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:30,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 15:19:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:30,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:30,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 15:19:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-13 15:19:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:19:30,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354821801] [2022-12-13 15:19:30,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354821801] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:19:30,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605414744] [2022-12-13 15:19:30,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:30,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:19:30,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:19:30,068 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:19:30,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 15:19:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:30,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:19:30,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:19:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 15:19:30,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:19:30,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605414744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:19:30,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:19:30,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:19:30,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891978858] [2022-12-13 15:19:30,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:19:30,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:19:30,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:19:30,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:19:30,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:30,193 INFO L87 Difference]: Start difference. First operand 51933 states and 69131 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 15:19:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:19:34,521 INFO L93 Difference]: Finished difference Result 92895 states and 123871 transitions. [2022-12-13 15:19:34,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:19:34,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2022-12-13 15:19:34,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:19:34,642 INFO L225 Difference]: With dead ends: 92895 [2022-12-13 15:19:34,642 INFO L226 Difference]: Without dead ends: 52777 [2022-12-13 15:19:34,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:34,697 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 151 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 400 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 15:19:34,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 400 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:19:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52777 states. [2022-12-13 15:19:38,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52777 to 51933. [2022-12-13 15:19:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51933 states, 44065 states have (on average 1.2777487802110519) internal successors, (56304), 44546 states have internal predecessors, (56304), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2022-12-13 15:19:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51933 states to 51933 states and 68771 transitions. [2022-12-13 15:19:39,036 INFO L78 Accepts]: Start accepts. Automaton has 51933 states and 68771 transitions. Word has length 161 [2022-12-13 15:19:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:19:39,036 INFO L495 AbstractCegarLoop]: Abstraction has 51933 states and 68771 transitions. [2022-12-13 15:19:39,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 15:19:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 51933 states and 68771 transitions. [2022-12-13 15:19:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 15:19:39,082 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:19:39,082 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, 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 15:19:39,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 15:19:39,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 15:19:39,283 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:19:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1698954724, now seen corresponding path program 1 times [2022-12-13 15:19:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:39,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978318626] [2022-12-13 15:19:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:19:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:19:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:19:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:19:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:19:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 15:19:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 15:19:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 15:19:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 15:19:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-12-13 15:19:39,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:19:39,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978318626] [2022-12-13 15:19:39,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978318626] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:19:39,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148101866] [2022-12-13 15:19:39,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:39,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:19:39,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:19:39,374 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:19:39,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 15:19:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:39,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:19:39,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:19:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-13 15:19:39,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:19:39,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148101866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:19:39,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:19:39,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:19:39,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796655123] [2022-12-13 15:19:39,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:19:39,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:19:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:19:39,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:19:39,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:39,484 INFO L87 Difference]: Start difference. First operand 51933 states and 68771 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 15:19:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:19:43,685 INFO L93 Difference]: Finished difference Result 92605 states and 122981 transitions. [2022-12-13 15:19:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:19:43,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2022-12-13 15:19:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:19:43,813 INFO L225 Difference]: With dead ends: 92605 [2022-12-13 15:19:43,813 INFO L226 Difference]: Without dead ends: 53329 [2022-12-13 15:19:43,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:19:43,867 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 150 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 416 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 15:19:43,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 416 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:19:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53329 states. [2022-12-13 15:19:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53329 to 51813. [2022-12-13 15:19:48,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51813 states, 43945 states have (on average 1.2703151666856298) internal successors, (55824), 44426 states have internal predecessors, (55824), 4267 states have call successors, (4267), 3217 states have call predecessors, (4267), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2022-12-13 15:19:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51813 states to 51813 states and 68291 transitions. [2022-12-13 15:19:48,287 INFO L78 Accepts]: Start accepts. Automaton has 51813 states and 68291 transitions. Word has length 161 [2022-12-13 15:19:48,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:19:48,288 INFO L495 AbstractCegarLoop]: Abstraction has 51813 states and 68291 transitions. [2022-12-13 15:19:48,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 15:19:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 51813 states and 68291 transitions. [2022-12-13 15:19:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 15:19:48,332 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:19:48,333 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:19:48,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 15:19:48,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 15:19:48,534 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:19:48,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash 590012799, now seen corresponding path program 1 times [2022-12-13 15:19:48,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:48,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332407141] [2022-12-13 15:19:48,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:48,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:19:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:48,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:19:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:19:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:48,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:19:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:48,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:19:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:48,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 15:19:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 15:19:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:48,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:48,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-12-13 15:19:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:48,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 15:19:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-12-13 15:19:48,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:19:48,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332407141] [2022-12-13 15:19:48,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332407141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:19:48,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:19:48,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:19:48,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245276244] [2022-12-13 15:19:48,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:19:48,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:19:48,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:19:48,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:19:48,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:19:48,597 INFO L87 Difference]: Start difference. First operand 51813 states and 68291 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 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 15:19:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:19:53,052 INFO L93 Difference]: Finished difference Result 101193 states and 132294 transitions. [2022-12-13 15:19:53,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:19:53,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2022-12-13 15:19:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:19:53,161 INFO L225 Difference]: With dead ends: 101193 [2022-12-13 15:19:53,162 INFO L226 Difference]: Without dead ends: 49405 [2022-12-13 15:19:53,224 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 15:19:53,224 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 304 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:19:53,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 278 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:19:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49405 states. [2022-12-13 15:19:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49405 to 46687. [2022-12-13 15:19:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46687 states, 39903 states have (on average 1.27083176703506) internal successors, (50710), 40796 states have internal predecessors, (50710), 3255 states have call successors, (3255), 2473 states have call predecessors, (3255), 3528 states have return successors, (6773), 3449 states have call predecessors, (6773), 3253 states have call successors, (6773) [2022-12-13 15:19:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46687 states to 46687 states and 60738 transitions. [2022-12-13 15:19:57,554 INFO L78 Accepts]: Start accepts. Automaton has 46687 states and 60738 transitions. Word has length 161 [2022-12-13 15:19:57,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:19:57,554 INFO L495 AbstractCegarLoop]: Abstraction has 46687 states and 60738 transitions. [2022-12-13 15:19:57,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 3 states have internal predecessors, (76), 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 15:19:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 46687 states and 60738 transitions. [2022-12-13 15:19:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-12-13 15:19:57,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:19:57,586 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:19:57,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 15:19:57,586 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:19:57,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:19:57,586 INFO L85 PathProgramCache]: Analyzing trace with hash -806789094, now seen corresponding path program 1 times [2022-12-13 15:19:57,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:19:57,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600051853] [2022-12-13 15:19:57,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:19:57,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:19:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:57,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:19:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:19:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:57,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:19:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:57,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:19:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:19:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:57,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 15:19:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:57,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 15:19:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:57,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:57,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 15:19:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:57,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:19:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:57,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-12-13 15:19:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:19:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-12-13 15:19:57,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:19:57,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600051853] [2022-12-13 15:19:57,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600051853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:19:57,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:19:57,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:19:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496755685] [2022-12-13 15:19:57,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:19:57,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:19:57,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:19:57,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:19:57,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:19:57,642 INFO L87 Difference]: Start difference. First operand 46687 states and 60738 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 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 15:20:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:20:01,326 INFO L93 Difference]: Finished difference Result 84469 states and 109697 transitions. [2022-12-13 15:20:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:20:01,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2022-12-13 15:20:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:20:01,401 INFO L225 Difference]: With dead ends: 84469 [2022-12-13 15:20:01,402 INFO L226 Difference]: Without dead ends: 37799 [2022-12-13 15:20:01,452 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 15:20:01,452 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 304 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:20:01,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 276 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:20:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37799 states. [2022-12-13 15:20:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37799 to 35149. [2022-12-13 15:20:04,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35149 states, 30111 states have (on average 1.2804622895287436) internal successors, (38556), 30748 states have internal predecessors, (38556), 2429 states have call successors, (2429), 1857 states have call predecessors, (2429), 2608 states have return successors, (4799), 2559 states have call predecessors, (4799), 2427 states have call successors, (4799) [2022-12-13 15:20:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35149 states to 35149 states and 45784 transitions. [2022-12-13 15:20:04,883 INFO L78 Accepts]: Start accepts. Automaton has 35149 states and 45784 transitions. Word has length 161 [2022-12-13 15:20:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:20:04,884 INFO L495 AbstractCegarLoop]: Abstraction has 35149 states and 45784 transitions. [2022-12-13 15:20:04,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 3 states have internal predecessors, (79), 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 15:20:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 35149 states and 45784 transitions. [2022-12-13 15:20:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 15:20:04,903 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:20:04,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:20:04,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 15:20:04,903 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:20:04,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:20:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash -994779915, now seen corresponding path program 1 times [2022-12-13 15:20:04,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:20:04,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712877954] [2022-12-13 15:20:04,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:04,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:20:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:04,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:20:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:04,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:20:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:04,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:20:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:04,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:20:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:04,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:20:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:20:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:04,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:20:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:04,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:04,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 15:20:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:04,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 15:20:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:04,987 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 15:20:04,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:20:04,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712877954] [2022-12-13 15:20:04,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712877954] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:20:04,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972830217] [2022-12-13 15:20:04,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:04,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:04,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:20:04,989 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:20:04,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 15:20:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:05,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:20:05,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:20:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 15:20:05,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:20:05,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972830217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:20:05,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:20:05,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:20:05,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465223007] [2022-12-13 15:20:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:20:05,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:20:05,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:20:05,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:20:05,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:20:05,077 INFO L87 Difference]: Start difference. First operand 35149 states and 45784 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (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 15:20:08,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:20:08,244 INFO L93 Difference]: Finished difference Result 59211 states and 79368 transitions. [2022-12-13 15:20:08,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:20:08,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-12-13 15:20:08,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:20:08,324 INFO L225 Difference]: With dead ends: 59211 [2022-12-13 15:20:08,324 INFO L226 Difference]: Without dead ends: 35321 [2022-12-13 15:20:08,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:20:08,364 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 142 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 465 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 15:20:08,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 465 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:20:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35321 states. [2022-12-13 15:20:11,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35321 to 35149. [2022-12-13 15:20:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35149 states, 30111 states have (on average 1.257547075819468) internal successors, (37866), 30748 states have internal predecessors, (37866), 2429 states have call successors, (2429), 1857 states have call predecessors, (2429), 2608 states have return successors, (4799), 2559 states have call predecessors, (4799), 2427 states have call successors, (4799) [2022-12-13 15:20:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35149 states to 35149 states and 45094 transitions. [2022-12-13 15:20:11,784 INFO L78 Accepts]: Start accepts. Automaton has 35149 states and 45094 transitions. Word has length 163 [2022-12-13 15:20:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:20:11,784 INFO L495 AbstractCegarLoop]: Abstraction has 35149 states and 45094 transitions. [2022-12-13 15:20:11,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 3 states have call successors, (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 15:20:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 35149 states and 45094 transitions. [2022-12-13 15:20:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 15:20:11,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:20:11,807 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, 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 15:20:11,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 15:20:12,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:12,008 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:20:12,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:20:12,009 INFO L85 PathProgramCache]: Analyzing trace with hash 337114389, now seen corresponding path program 1 times [2022-12-13 15:20:12,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:20:12,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270427552] [2022-12-13 15:20:12,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:12,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:20:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:20:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:20:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:20:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:20:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:20:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:20:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:20:12,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 15:20:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 15:20:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 15:20:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:20:12,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270427552] [2022-12-13 15:20:12,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270427552] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:20:12,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455992131] [2022-12-13 15:20:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:12,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:12,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:20:12,102 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:20:12,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 15:20:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:12,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:20:12,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:20:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 15:20:12,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:20:12,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455992131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:20:12,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:20:12,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:20:12,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40334480] [2022-12-13 15:20:12,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:20:12,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:20:12,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:20:12,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:20:12,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:20:12,211 INFO L87 Difference]: Start difference. First operand 35149 states and 45094 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 15:20:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:20:15,090 INFO L93 Difference]: Finished difference Result 62377 states and 81626 transitions. [2022-12-13 15:20:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:20:15,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 163 [2022-12-13 15:20:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:20:15,148 INFO L225 Difference]: With dead ends: 62377 [2022-12-13 15:20:15,148 INFO L226 Difference]: Without dead ends: 29709 [2022-12-13 15:20:15,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:20:15,195 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 165 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 222 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 15:20:15,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 222 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:20:15,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29709 states. [2022-12-13 15:20:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29709 to 28465. [2022-12-13 15:20:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28465 states, 24467 states have (on average 1.2231168512690562) internal successors, (29926), 24961 states have internal predecessors, (29926), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2022-12-13 15:20:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28465 states to 28465 states and 35396 transitions. [2022-12-13 15:20:18,017 INFO L78 Accepts]: Start accepts. Automaton has 28465 states and 35396 transitions. Word has length 163 [2022-12-13 15:20:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:20:18,018 INFO L495 AbstractCegarLoop]: Abstraction has 28465 states and 35396 transitions. [2022-12-13 15:20:18,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 15:20:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 28465 states and 35396 transitions. [2022-12-13 15:20:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 15:20:18,031 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:20:18,032 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, 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 15:20:18,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 15:20:18,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:18,233 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:20:18,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:20:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1269839222, now seen corresponding path program 1 times [2022-12-13 15:20:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:20:18,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529166857] [2022-12-13 15:20:18,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:18,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:20:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:20:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:20:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:20:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:20:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:20:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:20:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:20:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-12-13 15:20:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-12-13 15:20:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-13 15:20:18,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:20:18,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529166857] [2022-12-13 15:20:18,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529166857] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:20:18,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917997931] [2022-12-13 15:20:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:18,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:18,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:20:18,346 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:20:18,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 15:20:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:18,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:20:18,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:20:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 15:20:18,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:20:18,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917997931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:20:18,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:20:18,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:20:18,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018667016] [2022-12-13 15:20:18,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:20:18,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:20:18,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:20:18,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:20:18,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:20:18,445 INFO L87 Difference]: Start difference. First operand 28465 states and 35396 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 15:20:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:20:21,158 INFO L93 Difference]: Finished difference Result 48785 states and 62366 transitions. [2022-12-13 15:20:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:20:21,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-12-13 15:20:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:20:21,213 INFO L225 Difference]: With dead ends: 48785 [2022-12-13 15:20:21,213 INFO L226 Difference]: Without dead ends: 28605 [2022-12-13 15:20:21,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:20:21,245 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 135 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 507 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 15:20:21,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 507 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:20:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28605 states. [2022-12-13 15:20:24,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28605 to 28465. [2022-12-13 15:20:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28465 states, 24467 states have (on average 1.1957330281603793) internal successors, (29256), 24961 states have internal predecessors, (29256), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2022-12-13 15:20:24,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28465 states to 28465 states and 34726 transitions. [2022-12-13 15:20:24,105 INFO L78 Accepts]: Start accepts. Automaton has 28465 states and 34726 transitions. Word has length 163 [2022-12-13 15:20:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:20:24,105 INFO L495 AbstractCegarLoop]: Abstraction has 28465 states and 34726 transitions. [2022-12-13 15:20:24,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 15:20:24,105 INFO L276 IsEmpty]: Start isEmpty. Operand 28465 states and 34726 transitions. [2022-12-13 15:20:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-12-13 15:20:24,119 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:20:24,119 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:20:24,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 15:20:24,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:24,320 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:20:24,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:20:24,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1732528486, now seen corresponding path program 1 times [2022-12-13 15:20:24,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:20:24,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951355881] [2022-12-13 15:20:24,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:24,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:20:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:20:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:20:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:20:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:20:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:20:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:20:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:20:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 15:20:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-12-13 15:20:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 15:20:24,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:20:24,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951355881] [2022-12-13 15:20:24,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951355881] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:20:24,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553982227] [2022-12-13 15:20:24,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:24,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:24,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:20:24,418 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:20:24,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 15:20:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:24,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 15:20:24,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:20:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 15:20:24,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:20:24,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553982227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:20:24,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:20:24,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 15:20:24,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241693257] [2022-12-13 15:20:24,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:20:24,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:20:24,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:20:24,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:20:24,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:20:24,508 INFO L87 Difference]: Start difference. First operand 28465 states and 34726 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 15:20:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:20:27,222 INFO L93 Difference]: Finished difference Result 42334 states and 52798 transitions. [2022-12-13 15:20:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:20:27,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 164 [2022-12-13 15:20:27,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:20:27,276 INFO L225 Difference]: With dead ends: 42334 [2022-12-13 15:20:27,276 INFO L226 Difference]: Without dead ends: 28513 [2022-12-13 15:20:27,303 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 15:20:27,304 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 156 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 479 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 15:20:27,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 479 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:20:27,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28513 states. [2022-12-13 15:20:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28513 to 28465. [2022-12-13 15:20:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28465 states, 24467 states have (on average 1.1853516982057466) internal successors, (29002), 24961 states have internal predecessors, (29002), 1933 states have call successors, (1933), 1481 states have call predecessors, (1933), 2064 states have return successors, (3537), 2030 states have call predecessors, (3537), 1931 states have call successors, (3537) [2022-12-13 15:20:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28465 states to 28465 states and 34472 transitions. [2022-12-13 15:20:30,157 INFO L78 Accepts]: Start accepts. Automaton has 28465 states and 34472 transitions. Word has length 164 [2022-12-13 15:20:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:20:30,157 INFO L495 AbstractCegarLoop]: Abstraction has 28465 states and 34472 transitions. [2022-12-13 15:20:30,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 15:20:30,158 INFO L276 IsEmpty]: Start isEmpty. Operand 28465 states and 34472 transitions. [2022-12-13 15:20:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 15:20:30,172 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:20:30,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:20:30,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 15:20:30,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-13 15:20:30,374 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:20:30,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:20:30,374 INFO L85 PathProgramCache]: Analyzing trace with hash 117096205, now seen corresponding path program 1 times [2022-12-13 15:20:30,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:20:30,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90580886] [2022-12-13 15:20:30,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:30,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:20:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:20:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:20:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:20:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:20:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:20:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:20:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:20:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 15:20:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 15:20:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 15:20:30,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:20:30,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90580886] [2022-12-13 15:20:30,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90580886] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:20:30,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959927267] [2022-12-13 15:20:30,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:30,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:30,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:20:30,485 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:20:30,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 15:20:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:30,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:20:30,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:20:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-12-13 15:20:30,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:20:30,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959927267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:20:30,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:20:30,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 15:20:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91125777] [2022-12-13 15:20:30,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:20:30,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:20:30,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:20:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:20:30,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:20:30,623 INFO L87 Difference]: Start difference. First operand 28465 states and 34472 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:20:32,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:20:32,745 INFO L93 Difference]: Finished difference Result 39017 states and 47591 transitions. [2022-12-13 15:20:32,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:20:32,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 15:20:32,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:20:32,782 INFO L225 Difference]: With dead ends: 39017 [2022-12-13 15:20:32,782 INFO L226 Difference]: Without dead ends: 20411 [2022-12-13 15:20:32,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 15:20:32,806 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 188 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 15:20:32,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 309 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 15:20:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20411 states. [2022-12-13 15:20:34,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20411 to 20351. [2022-12-13 15:20:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20351 states, 17513 states have (on average 1.1679323930794268) internal successors, (20454), 17840 states have internal predecessors, (20454), 1389 states have call successors, (1389), 1057 states have call predecessors, (1389), 1448 states have return successors, (2451), 1457 states have call predecessors, (2451), 1387 states have call successors, (2451) [2022-12-13 15:20:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20351 states to 20351 states and 24294 transitions. [2022-12-13 15:20:34,899 INFO L78 Accepts]: Start accepts. Automaton has 20351 states and 24294 transitions. Word has length 165 [2022-12-13 15:20:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:20:34,900 INFO L495 AbstractCegarLoop]: Abstraction has 20351 states and 24294 transitions. [2022-12-13 15:20:34,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:20:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 20351 states and 24294 transitions. [2022-12-13 15:20:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 15:20:34,907 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:20:34,907 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:20:34,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 15:20:35,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:35,108 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:20:35,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:20:35,109 INFO L85 PathProgramCache]: Analyzing trace with hash 605143311, now seen corresponding path program 1 times [2022-12-13 15:20:35,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:20:35,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706124644] [2022-12-13 15:20:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:20:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:20:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:20:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:20:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:20:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:20:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:20:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:20:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 15:20:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 15:20:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 15:20:35,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:20:35,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706124644] [2022-12-13 15:20:35,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706124644] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:20:35,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155357523] [2022-12-13 15:20:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:35,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:35,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:20:35,227 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:20:35,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 15:20:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:35,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:20:35,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:20:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-12-13 15:20:35,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:20:35,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155357523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:20:35,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:20:35,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 15:20:35,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137327074] [2022-12-13 15:20:35,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:20:35,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:20:35,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:20:35,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:20:35,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:20:35,336 INFO L87 Difference]: Start difference. First operand 20351 states and 24294 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 15:20:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:20:37,245 INFO L93 Difference]: Finished difference Result 34460 states and 41587 transitions. [2022-12-13 15:20:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:20:37,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 15:20:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:20:37,270 INFO L225 Difference]: With dead ends: 34460 [2022-12-13 15:20:37,270 INFO L226 Difference]: Without dead ends: 14121 [2022-12-13 15:20:37,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:20:37,295 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 87 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 744 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 15:20:37,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 744 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:20:37,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14121 states. [2022-12-13 15:20:38,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14121 to 13329. [2022-12-13 15:20:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13329 states, 11382 states have (on average 1.1476014760147601) internal successors, (13062), 11592 states have internal predecessors, (13062), 958 states have call successors, (958), 737 states have call predecessors, (958), 988 states have return successors, (1535), 1001 states have call predecessors, (1535), 956 states have call successors, (1535) [2022-12-13 15:20:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13329 states to 13329 states and 15555 transitions. [2022-12-13 15:20:38,744 INFO L78 Accepts]: Start accepts. Automaton has 13329 states and 15555 transitions. Word has length 165 [2022-12-13 15:20:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:20:38,745 INFO L495 AbstractCegarLoop]: Abstraction has 13329 states and 15555 transitions. [2022-12-13 15:20:38,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 15:20:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 13329 states and 15555 transitions. [2022-12-13 15:20:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 15:20:38,749 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:20:38,749 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:20:38,753 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 15:20:38,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:38,950 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:20:38,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:20:38,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1688836692, now seen corresponding path program 1 times [2022-12-13 15:20:38,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:20:38,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424004968] [2022-12-13 15:20:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:20:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:20:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:20:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:20:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:20:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:20:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:20:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:20:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 15:20:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 15:20:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-12-13 15:20:39,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:20:39,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424004968] [2022-12-13 15:20:39,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424004968] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:20:39,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356706554] [2022-12-13 15:20:39,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:39,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:39,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:20:39,054 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:20:39,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 15:20:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:39,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:20:39,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:20:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-12-13 15:20:39,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:20:39,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356706554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:20:39,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:20:39,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 15:20:39,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332195754] [2022-12-13 15:20:39,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:20:39,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:20:39,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:20:39,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:20:39,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:20:39,154 INFO L87 Difference]: Start difference. First operand 13329 states and 15555 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:20:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:20:40,431 INFO L93 Difference]: Finished difference Result 24594 states and 29079 transitions. [2022-12-13 15:20:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:20:40,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 15:20:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:20:40,446 INFO L225 Difference]: With dead ends: 24594 [2022-12-13 15:20:40,447 INFO L226 Difference]: Without dead ends: 11277 [2022-12-13 15:20:40,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:20:40,458 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 49 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 730 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 15:20:40,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 730 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:20:40,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11277 states. [2022-12-13 15:20:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11277 to 10981. [2022-12-13 15:20:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10981 states, 9343 states have (on average 1.1294016911056406) internal successors, (10552), 9503 states have internal predecessors, (10552), 815 states have call successors, (815), 621 states have call predecessors, (815), 822 states have return successors, (1201), 858 states have call predecessors, (1201), 813 states have call successors, (1201) [2022-12-13 15:20:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10981 states to 10981 states and 12568 transitions. [2022-12-13 15:20:41,629 INFO L78 Accepts]: Start accepts. Automaton has 10981 states and 12568 transitions. Word has length 165 [2022-12-13 15:20:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:20:41,629 INFO L495 AbstractCegarLoop]: Abstraction has 10981 states and 12568 transitions. [2022-12-13 15:20:41,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:20:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 10981 states and 12568 transitions. [2022-12-13 15:20:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-12-13 15:20:41,633 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:20:41,633 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:20:41,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 15:20:41,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 15:20:41,834 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:20:41,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:20:41,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1857225114, now seen corresponding path program 1 times [2022-12-13 15:20:41,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:20:41,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132265593] [2022-12-13 15:20:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:41,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:20:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:20:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:20:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:20:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:20:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:20:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 15:20:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 15:20:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 15:20:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-12-13 15:20:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-12-13 15:20:41,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:20:41,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132265593] [2022-12-13 15:20:41,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132265593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:20:41,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190013012] [2022-12-13 15:20:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:41,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:20:41,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:20:41,929 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:20:41,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 15:20:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:41,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:20:41,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:20:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-13 15:20:42,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:20:42,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190013012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:20:42,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 15:20:42,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 15:20:42,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183770008] [2022-12-13 15:20:42,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:20:42,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:20:42,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:20:42,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:20:42,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:20:42,018 INFO L87 Difference]: Start difference. First operand 10981 states and 12568 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:20:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:20:42,643 INFO L93 Difference]: Finished difference Result 16294 states and 18723 transitions. [2022-12-13 15:20:42,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:20:42,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-12-13 15:20:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:20:42,648 INFO L225 Difference]: With dead ends: 16294 [2022-12-13 15:20:42,648 INFO L226 Difference]: Without dead ends: 3289 [2022-12-13 15:20:42,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 15:20:42,657 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 10 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 715 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 15:20:42,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 715 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 15:20:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2022-12-13 15:20:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3289. [2022-12-13 15:20:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 2794 states have (on average 1.1016463851109521) internal successors, (3078), 2816 states have internal predecessors, (3078), 278 states have call successors, (278), 201 states have call predecessors, (278), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2022-12-13 15:20:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 3657 transitions. [2022-12-13 15:20:42,997 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 3657 transitions. Word has length 165 [2022-12-13 15:20:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:20:42,997 INFO L495 AbstractCegarLoop]: Abstraction has 3289 states and 3657 transitions. [2022-12-13 15:20:42,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 15:20:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 3657 transitions. [2022-12-13 15:20:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-12-13 15:20:42,999 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:20:42,999 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:20:43,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 15:20:43,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 15:20:43,201 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:20:43,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:20:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1928071536, now seen corresponding path program 1 times [2022-12-13 15:20:43,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:20:43,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693126497] [2022-12-13 15:20:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:20:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:20:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:20:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:20:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:20:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:20:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 15:20:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 15:20:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 15:20:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 15:20:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 15:20:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-12-13 15:20:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:20:43,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693126497] [2022-12-13 15:20:43,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693126497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:20:43,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:20:43,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 15:20:43,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704677196] [2022-12-13 15:20:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:20:43,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:20:43,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:20:43,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:20:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:20:43,349 INFO L87 Difference]: Start difference. First operand 3289 states and 3657 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 15:20:44,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:20:44,341 INFO L93 Difference]: Finished difference Result 3507 states and 3882 transitions. [2022-12-13 15:20:44,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 15:20:44,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2022-12-13 15:20:44,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:20:44,346 INFO L225 Difference]: With dead ends: 3507 [2022-12-13 15:20:44,346 INFO L226 Difference]: Without dead ends: 3504 [2022-12-13 15:20:44,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-12-13 15:20:44,348 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 701 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 15:20:44,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 799 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 15:20:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2022-12-13 15:20:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 3288. [2022-12-13 15:20:44,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3288 states, 2794 states have (on average 1.1002147458840372) internal successors, (3074), 2815 states have internal predecessors, (3074), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2022-12-13 15:20:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 3652 transitions. [2022-12-13 15:20:44,745 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 3652 transitions. Word has length 203 [2022-12-13 15:20:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:20:44,746 INFO L495 AbstractCegarLoop]: Abstraction has 3288 states and 3652 transitions. [2022-12-13 15:20:44,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-13 15:20:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 3652 transitions. [2022-12-13 15:20:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-13 15:20:44,748 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:20:44,748 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:20:44,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 15:20:44,748 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:20:44,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:20:44,748 INFO L85 PathProgramCache]: Analyzing trace with hash 704894808, now seen corresponding path program 1 times [2022-12-13 15:20:44,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:20:44,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501039509] [2022-12-13 15:20:44,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:20:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 15:20:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 15:20:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 15:20:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-12-13 15:20:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 15:20:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-12-13 15:20:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 15:20:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 15:20:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-12-13 15:20:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 15:20:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-12-13 15:20:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:20:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-12-13 15:20:44,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:20:44,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501039509] [2022-12-13 15:20:44,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501039509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:20:44,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:20:44,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:20:44,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715429250] [2022-12-13 15:20:44,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:20:44,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:20:44,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:20:44,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:20:44,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:20:44,813 INFO L87 Difference]: Start difference. First operand 3288 states and 3652 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 15:20:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:20:45,572 INFO L93 Difference]: Finished difference Result 5331 states and 6023 transitions. [2022-12-13 15:20:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:20:45,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2022-12-13 15:20:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 15:20:45,579 INFO L225 Difference]: With dead ends: 5331 [2022-12-13 15:20:45,579 INFO L226 Difference]: Without dead ends: 3952 [2022-12-13 15:20:45,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:20:45,581 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 199 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 15:20:45,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 529 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 15:20:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2022-12-13 15:20:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3292. [2022-12-13 15:20:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 2798 states have (on average 1.100071479628306) internal successors, (3078), 2819 states have internal predecessors, (3078), 277 states have call successors, (277), 201 states have call predecessors, (277), 216 states have return successors, (301), 273 states have call predecessors, (301), 276 states have call successors, (301) [2022-12-13 15:20:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 3656 transitions. [2022-12-13 15:20:45,991 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 3656 transitions. Word has length 207 [2022-12-13 15:20:45,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 15:20:45,991 INFO L495 AbstractCegarLoop]: Abstraction has 3292 states and 3656 transitions. [2022-12-13 15:20:45,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 15:20:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 3656 transitions. [2022-12-13 15:20:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-13 15:20:45,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 15:20:45,993 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:20:45,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 15:20:45,993 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 15:20:45,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:20:45,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1606001686, now seen corresponding path program 1 times [2022-12-13 15:20:45,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:20:45,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794676351] [2022-12-13 15:20:45,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:20:45,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:20:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:20:46,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:20:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:20:46,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:20:46,090 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:20:46,090 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 15:20:46,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 15:20:46,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 15:20:46,094 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 15:20:46,097 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:20:46,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:20:46 BoogieIcfgContainer [2022-12-13 15:20:46,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:20:46,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:20:46,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:20:46,192 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:20:46,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:18:38" (3/4) ... [2022-12-13 15:20:46,193 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 15:20:46,275 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 15:20:46,276 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:20:46,276 INFO L158 Benchmark]: Toolchain (without parser) took 128940.70ms. Allocated memory was 127.9MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 94.7MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-12-13 15:20:46,276 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 127.9MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:20:46,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.03ms. Allocated memory is still 127.9MB. Free memory was 94.2MB in the beginning and 77.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 15:20:46,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.81ms. Allocated memory is still 127.9MB. Free memory was 77.4MB in the beginning and 74.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 15:20:46,276 INFO L158 Benchmark]: Boogie Preprocessor took 34.49ms. Allocated memory is still 127.9MB. Free memory was 74.6MB in the beginning and 72.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:20:46,277 INFO L158 Benchmark]: RCFGBuilder took 527.76ms. Allocated memory is still 127.9MB. Free memory was 72.1MB in the beginning and 79.3MB in the end (delta: -7.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 15:20:46,277 INFO L158 Benchmark]: TraceAbstraction took 127969.57ms. Allocated memory was 127.9MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 78.7MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-12-13 15:20:46,277 INFO L158 Benchmark]: Witness Printer took 84.29ms. Allocated memory is still 4.5GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 15:20:46,278 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 127.9MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.03ms. Allocated memory is still 127.9MB. Free memory was 94.2MB in the beginning and 77.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.81ms. Allocated memory is still 127.9MB. Free memory was 77.4MB in the beginning and 74.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.49ms. Allocated memory is still 127.9MB. Free memory was 74.6MB in the beginning and 72.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.76ms. Allocated memory is still 127.9MB. Free memory was 72.1MB in the beginning and 79.3MB in the end (delta: -7.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 127969.57ms. Allocated memory was 127.9MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 78.7MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 84.29ms. Allocated memory is still 4.5GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int t2_pc = 0; [L397] int m_st ; [L398] int t1_st ; [L399] int t2_st ; [L400] int m_i ; [L401] int t1_i ; [L402] int t2_i ; [L403] int M_E = 2; [L404] int T1_E = 2; [L405] int T2_E = 2; [L406] int E_M = 2; [L407] int E_1 = 2; [L408] int E_2 = 2; [L413] int token ; [L415] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L996] CALL main2() [L980] int __retres1 ; [L984] CALL init_model2() [L894] m_i = 1 [L895] t1_i = 1 [L896] t2_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L984] RET init_model2() [L985] CALL start_simulation2() [L921] int kernel_st ; [L922] int tmp ; [L923] int tmp___0 ; [L927] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L928] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L929] CALL init_threads2() [L613] COND TRUE m_i == 1 [L614] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L618] COND TRUE t1_i == 1 [L619] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L623] COND TRUE t2_i == 1 [L624] t2_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L929] RET init_threads2() [L930] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L726] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L731] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L736] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L741] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L746] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L751] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L930] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L931] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L548] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L558] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L564] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L567] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L577] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L579] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L821] CALL, EXPR is_transmit2_triggered() [L583] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L586] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L596] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L598] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L931] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L932] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L764] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L774] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L779] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L784] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L789] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L932] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L935] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L938] kernel_st = 1 [L939] CALL eval2() [L659] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L663] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L633] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L636] COND TRUE m_st == 0 [L637] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L654] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L666] tmp = exists_runnable_thread2() [L668] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L673] COND TRUE m_st == 0 [L674] int tmp_ndt_1; [L675] tmp_ndt_1 = __VERIFIER_nondet_int() [L676] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L687] COND TRUE t1_st == 0 [L688] int tmp_ndt_2; [L689] tmp_ndt_2 = __VERIFIER_nondet_int() [L690] COND TRUE \read(tmp_ndt_2) [L692] t1_st = 1 [L693] CALL transmit1() [L476] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L487] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L489] t1_pc = 1 [L490] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L693] RET transmit1() [L701] COND TRUE t2_st == 0 [L702] int tmp_ndt_3; [L703] tmp_ndt_3 = __VERIFIER_nondet_int() [L704] COND TRUE \read(tmp_ndt_3) [L706] t2_st = 1 [L707] CALL transmit2() [L512] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L523] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L525] t2_pc = 1 [L526] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L707] RET transmit2() [L663] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L666] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L633] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L636] COND TRUE m_st == 0 [L637] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L654] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L666] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L666] tmp = exists_runnable_thread2() [L668] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, token=0] [L673] COND TRUE m_st == 0 [L674] int tmp_ndt_1; [L675] tmp_ndt_1 = __VERIFIER_nondet_int() [L676] COND TRUE \read(tmp_ndt_1) [L678] m_st = 1 [L679] CALL master() [L418] int tmp_var = __VERIFIER_nondet_int(); [L420] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L431] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L434] token = __VERIFIER_nondet_int() [L435] local = token [L436] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L437] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L837] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L548] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L558] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L560] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L564] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L567] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L568] COND TRUE E_1 == 1 [L569] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L579] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L821] CALL, EXPR is_transmit2_triggered() [L583] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L586] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L587] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L596] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L598] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L837] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L437] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L438] E_1 = 2 [L439] m_pc = 1 [L440] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L679] RET master() [L687] COND TRUE t1_st == 0 [L688] int tmp_ndt_2; [L689] tmp_ndt_2 = __VERIFIER_nondet_int() [L690] COND TRUE \read(tmp_ndt_2) [L692] t1_st = 1 [L693] CALL transmit1() [L476] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L479] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L495] token += 1 [L496] E_2 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L497] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L837] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L548] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L549] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L558] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L560] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L564] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L567] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L568] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L577] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L579] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L821] CALL, EXPR is_transmit2_triggered() [L583] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L586] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L587] COND TRUE E_2 == 1 [L588] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L598] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND TRUE \read(tmp___1) [L824] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L837] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L497] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L498] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L487] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L489] t1_pc = 1 [L490] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L693] RET transmit1() [L701] COND TRUE t2_st == 0 [L702] int tmp_ndt_3; [L703] tmp_ndt_3 = __VERIFIER_nondet_int() [L704] COND TRUE \read(tmp_ndt_3) [L706] t2_st = 1 [L707] CALL transmit2() [L512] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L515] COND TRUE t2_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L531] token += 1 [L532] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L533] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L837] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L799] int tmp ; [L800] int tmp___0 ; [L801] int tmp___1 ; [L805] CALL, EXPR is_master_triggered() [L545] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L548] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L549] COND TRUE E_M == 1 [L550] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L560] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L813] CALL, EXPR is_transmit1_triggered() [L564] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L567] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L568] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L577] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L579] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L821] CALL, EXPR is_transmit2_triggered() [L583] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L586] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L587] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L596] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L598] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L821] RET, EXPR is_transmit2_triggered() [L821] tmp___1 = is_transmit2_triggered() [L823] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L837] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L533] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L534] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L523] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L525] t2_pc = 1 [L526] t2_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L707] RET transmit2() [L663] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L666] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L633] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L636] COND TRUE m_st == 0 [L637] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L654] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L666] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L666] tmp = exists_runnable_thread2() [L668] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, tmp_ndt_3=1, token=2] [L673] COND TRUE m_st == 0 [L674] int tmp_ndt_1; [L675] tmp_ndt_1 = __VERIFIER_nondet_int() [L676] COND TRUE \read(tmp_ndt_1) [L678] m_st = 1 [L679] CALL master() [L418] int tmp_var = __VERIFIER_nondet_int(); [L420] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L423] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L445] COND FALSE !(token != local + 2) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L450] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L451] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L456] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L457] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L458] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L459] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L390] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 212 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 127.8s, OverallIterations: 40, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 63.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11078 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10806 mSDsluCounter, 23833 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14217 mSDsCounter, 1027 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10457 IncrementalHoareTripleChecker+Invalid, 11484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1027 mSolverCounterUnsat, 9616 mSDtfsCounter, 10457 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4290 GetRequests, 3976 SyntacticMatches, 6 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51933occurred in iteration=25, InterpolantAutomatonStates: 260, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 52.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 25942 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 8084 NumberOfCodeBlocks, 8084 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 7949 ConstructedInterpolants, 0 QuantifiedInterpolants, 13211 SizeOfPredicates, 13 NumberOfNonLiveVariables, 11172 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 64 InterpolantComputations, 38 PerfectInterpolantSequences, 3659/4278 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 15:20:46,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c7e82dee-9236-4560-98cf-04345930981a/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