./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.03.cil.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_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.03.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 --- 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-14 11:17:12,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:17:12,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:17:12,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:17:12,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:17:12,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:17:12,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:17:12,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:17:12,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:17:12,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:17:12,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:17:12,313 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:17:12,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:17:12,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:17:12,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:17:12,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:17:12,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:17:12,318 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:17:12,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:17:12,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:17:12,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:17:12,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:17:12,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:17:12,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:17:12,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:17:12,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:17:12,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:17:12,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:17:12,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:17:12,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:17:12,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:17:12,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:17:12,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:17:12,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:17:12,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:17:12,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:17:12,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:17:12,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:17:12,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:17:12,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:17:12,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:17:12,336 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 11:17:12,351 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:17:12,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:17:12,351 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:17:12,351 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:17:12,352 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:17:12,352 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:17:12,352 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:17:12,352 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:17:12,352 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:17:12,353 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:17:12,353 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:17:12,353 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:17:12,353 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:17:12,353 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:17:12,353 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:17:12,353 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:17:12,353 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:17:12,353 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:17:12,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:17:12,354 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:17:12,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:17:12,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:17:12,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:17:12,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 11:17:12,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:17:12,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 11:17:12,355 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:17:12,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 11:17:12,355 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:17:12,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 11:17:12,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:17:12,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:17:12,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:17:12,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:17:12,356 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:17:12,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:17:12,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 11:17:12,356 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:17:12,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:17:12,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 11:17:12,357 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:17:12,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/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_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh 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 -> Taipan 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 -> 4edad7c083448b81b05575191757512095bfff0f094103ddb1a592d0cd702494 [2022-12-14 11:17:12,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:17:12,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:17:12,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:17:12,551 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:17:12,552 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:17:12,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/systemc/transmitter.03.cil.c [2022-12-14 11:17:15,202 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:17:15,364 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:17:15,364 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/sv-benchmarks/c/systemc/transmitter.03.cil.c [2022-12-14 11:17:15,373 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/data/b3e25d855/0a6370d3627040d0b85e958e0d01dea9/FLAG9550dea3b [2022-12-14 11:17:15,387 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/data/b3e25d855/0a6370d3627040d0b85e958e0d01dea9 [2022-12-14 11:17:15,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:17:15,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:17:15,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:17:15,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:17:15,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:17:15,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463423b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15, skipping insertion in model container [2022-12-14 11:17:15,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:17:15,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:17:15,571 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_48699624-6834-4bcb-bfbe-29f089ce76d2/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2022-12-14 11:17:15,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:17:15,632 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:17:15,642 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_48699624-6834-4bcb-bfbe-29f089ce76d2/sv-benchmarks/c/systemc/transmitter.03.cil.c[706,719] [2022-12-14 11:17:15,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:17:15,678 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:17:15,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15 WrapperNode [2022-12-14 11:17:15,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:17:15,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:17:15,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:17:15,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:17:15,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,707 INFO L138 Inliner]: procedures = 34, calls = 39, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 321 [2022-12-14 11:17:15,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:17:15,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:17:15,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:17:15,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:17:15,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,726 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:17:15,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:17:15,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:17:15,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:17:15,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15" (1/1) ... [2022-12-14 11:17:15,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:17:15,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:17:15,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:17:15,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:17:15,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:17:15,792 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-14 11:17:15,793 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-14 11:17:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-14 11:17:15,793 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-14 11:17:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-14 11:17:15,793 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-14 11:17:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-14 11:17:15,793 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-14 11:17:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-14 11:17:15,793 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-14 11:17:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:17:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-14 11:17:15,793 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-14 11:17:15,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:17:15,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:17:15,860 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:17:15,862 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:17:16,171 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:17:16,257 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:17:16,257 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-12-14 11:17:16,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:17:16 BoogieIcfgContainer [2022-12-14 11:17:16,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:17:16,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:17:16,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:17:16,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:17:16,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:17:15" (1/3) ... [2022-12-14 11:17:16,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fc7b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:17:16, skipping insertion in model container [2022-12-14 11:17:16,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:17:15" (2/3) ... [2022-12-14 11:17:16,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59fc7b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:17:16, skipping insertion in model container [2022-12-14 11:17:16,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:17:16" (3/3) ... [2022-12-14 11:17:16,264 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2022-12-14 11:17:16,278 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:17:16,278 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 11:17:16,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:17:16,317 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=FINITE_AUTOMATA, 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;@6d3c2a99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:17:16,317 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 11:17:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 63 states have (on average 1.507936507936508) internal successors, (95), 65 states have internal predecessors, (95), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-14 11:17:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 11:17:16,327 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:16,327 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] [2022-12-14 11:17:16,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:16,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:16,332 INFO L85 PathProgramCache]: Analyzing trace with hash -271348905, now seen corresponding path program 1 times [2022-12-14 11:17:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:16,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600349816] [2022-12-14 11:17:16,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:16,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:16,612 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-14 11:17:16,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:16,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600349816] [2022-12-14 11:17:16,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600349816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:16,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:16,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:17:16,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079815837] [2022-12-14 11:17:16,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:16,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:17:16,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:16,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:17:16,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:17:16,649 INFO L87 Difference]: Start difference. First operand has 87 states, 63 states have (on average 1.507936507936508) internal successors, (95), 65 states have internal predecessors, (95), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:17:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:16,883 INFO L93 Difference]: Finished difference Result 248 states and 367 transitions. [2022-12-14 11:17:16,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:17:16,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-12-14 11:17:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:16,894 INFO L225 Difference]: With dead ends: 248 [2022-12-14 11:17:16,895 INFO L226 Difference]: Without dead ends: 162 [2022-12-14 11:17:16,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:17:16,902 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 210 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:16,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 298 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:17:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-12-14 11:17:16,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-12-14 11:17:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 117 states have (on average 1.4102564102564104) internal successors, (165), 119 states have internal predecessors, (165), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-12-14 11:17:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 221 transitions. [2022-12-14 11:17:16,962 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 221 transitions. Word has length 41 [2022-12-14 11:17:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:16,963 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 221 transitions. [2022-12-14 11:17:16,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:17:16,963 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 221 transitions. [2022-12-14 11:17:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 11:17:16,965 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:16,965 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] [2022-12-14 11:17:16,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 11:17:16,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:16,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash -2042819880, now seen corresponding path program 1 times [2022-12-14 11:17:16,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:16,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698028801] [2022-12-14 11:17:16,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:16,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:17,084 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-14 11:17:17,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:17,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698028801] [2022-12-14 11:17:17,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698028801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:17,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:17,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:17:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32694741] [2022-12-14 11:17:17,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:17,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:17:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:17,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:17:17,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:17:17,087 INFO L87 Difference]: Start difference. First operand 158 states and 221 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:17:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:17,474 INFO L93 Difference]: Finished difference Result 889 states and 1293 transitions. [2022-12-14 11:17:17,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:17:17,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-12-14 11:17:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:17,481 INFO L225 Difference]: With dead ends: 889 [2022-12-14 11:17:17,481 INFO L226 Difference]: Without dead ends: 736 [2022-12-14 11:17:17,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:17:17,485 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 428 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:17,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 500 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:17:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-12-14 11:17:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 700. [2022-12-14 11:17:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 527 states have (on average 1.3908918406072106) internal successors, (733), 535 states have internal predecessors, (733), 112 states have call successors, (112), 60 states have call predecessors, (112), 60 states have return successors, (154), 105 states have call predecessors, (154), 112 states have call successors, (154) [2022-12-14 11:17:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 999 transitions. [2022-12-14 11:17:17,563 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 999 transitions. Word has length 41 [2022-12-14 11:17:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:17,563 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 999 transitions. [2022-12-14 11:17:17,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:17:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 999 transitions. [2022-12-14 11:17:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 11:17:17,564 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:17,565 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] [2022-12-14 11:17:17,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 11:17:17,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:17,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash 194543385, now seen corresponding path program 1 times [2022-12-14 11:17:17,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:17,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995006912] [2022-12-14 11:17:17,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:17,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:17:17,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:17,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995006912] [2022-12-14 11:17:17,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995006912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:17,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:17,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:17:17,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744559636] [2022-12-14 11:17:17,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:17,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:17:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:17:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:17:17,636 INFO L87 Difference]: Start difference. First operand 700 states and 999 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:17:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:18,066 INFO L93 Difference]: Finished difference Result 2745 states and 4038 transitions. [2022-12-14 11:17:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:17:18,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-12-14 11:17:18,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:18,075 INFO L225 Difference]: With dead ends: 2745 [2022-12-14 11:17:18,076 INFO L226 Difference]: Without dead ends: 2050 [2022-12-14 11:17:18,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:17:18,079 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 427 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:18,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 507 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 11:17:18,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2022-12-14 11:17:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1822. [2022-12-14 11:17:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1381 states have (on average 1.392469225199131) internal successors, (1923), 1387 states have internal predecessors, (1923), 276 states have call successors, (276), 148 states have call predecessors, (276), 164 states have return successors, (464), 287 states have call predecessors, (464), 276 states have call successors, (464) [2022-12-14 11:17:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2663 transitions. [2022-12-14 11:17:18,170 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2663 transitions. Word has length 41 [2022-12-14 11:17:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:18,170 INFO L495 AbstractCegarLoop]: Abstraction has 1822 states and 2663 transitions. [2022-12-14 11:17:18,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:17:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2663 transitions. [2022-12-14 11:17:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 11:17:18,171 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:18,171 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-14 11:17:18,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 11:17:18,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:18,172 INFO L85 PathProgramCache]: Analyzing trace with hash -920493470, now seen corresponding path program 1 times [2022-12-14 11:17:18,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:18,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657564678] [2022-12-14 11:17:18,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:18,293 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-14 11:17:18,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:18,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657564678] [2022-12-14 11:17:18,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657564678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:18,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:18,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:17:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276654147] [2022-12-14 11:17:18,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:18,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:17:18,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:18,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:17:18,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:17:18,296 INFO L87 Difference]: Start difference. First operand 1822 states and 2663 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:17:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:18,708 INFO L93 Difference]: Finished difference Result 5031 states and 7385 transitions. [2022-12-14 11:17:18,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:17:18,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2022-12-14 11:17:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:18,728 INFO L225 Difference]: With dead ends: 5031 [2022-12-14 11:17:18,728 INFO L226 Difference]: Without dead ends: 3215 [2022-12-14 11:17:18,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:17:18,736 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 335 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:18,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 324 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:17:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2022-12-14 11:17:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 2855. [2022-12-14 11:17:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2855 states, 2182 states have (on average 1.3707607699358386) internal successors, (2991), 2191 states have internal predecessors, (2991), 406 states have call successors, (406), 238 states have call predecessors, (406), 266 states have return successors, (676), 426 states have call predecessors, (676), 406 states have call successors, (676) [2022-12-14 11:17:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 4073 transitions. [2022-12-14 11:17:18,970 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 4073 transitions. Word has length 44 [2022-12-14 11:17:18,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:18,970 INFO L495 AbstractCegarLoop]: Abstraction has 2855 states and 4073 transitions. [2022-12-14 11:17:18,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:17:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 4073 transitions. [2022-12-14 11:17:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 11:17:18,971 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:18,971 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-14 11:17:18,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 11:17:18,971 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:18,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash 518648048, now seen corresponding path program 1 times [2022-12-14 11:17:18,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:18,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052220542] [2022-12-14 11:17:18,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:19,082 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-14 11:17:19,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:19,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052220542] [2022-12-14 11:17:19,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052220542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:19,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:19,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:17:19,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882687015] [2022-12-14 11:17:19,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:19,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:17:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:17:19,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:17:19,085 INFO L87 Difference]: Start difference. First operand 2855 states and 4073 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:17:19,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:19,586 INFO L93 Difference]: Finished difference Result 7644 states and 11087 transitions. [2022-12-14 11:17:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:17:19,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2022-12-14 11:17:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:19,609 INFO L225 Difference]: With dead ends: 7644 [2022-12-14 11:17:19,610 INFO L226 Difference]: Without dead ends: 4795 [2022-12-14 11:17:19,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:17:19,619 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 271 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:19,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 286 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:17:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2022-12-14 11:17:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 4445. [2022-12-14 11:17:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4445 states, 3394 states have (on average 1.3529758397171479) internal successors, (4592), 3410 states have internal predecessors, (4592), 630 states have call successors, (630), 380 states have call predecessors, (630), 420 states have return successors, (1051), 655 states have call predecessors, (1051), 630 states have call successors, (1051) [2022-12-14 11:17:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4445 states to 4445 states and 6273 transitions. [2022-12-14 11:17:19,888 INFO L78 Accepts]: Start accepts. Automaton has 4445 states and 6273 transitions. Word has length 45 [2022-12-14 11:17:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:19,888 INFO L495 AbstractCegarLoop]: Abstraction has 4445 states and 6273 transitions. [2022-12-14 11:17:19,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 11:17:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4445 states and 6273 transitions. [2022-12-14 11:17:19,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 11:17:19,890 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:19,890 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] [2022-12-14 11:17:19,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 11:17:19,890 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:19,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:19,891 INFO L85 PathProgramCache]: Analyzing trace with hash -670653761, now seen corresponding path program 1 times [2022-12-14 11:17:19,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:19,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447406630] [2022-12-14 11:17:19,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:19,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:19,929 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-14 11:17:19,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:19,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447406630] [2022-12-14 11:17:19,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447406630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:19,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:19,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:17:19,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427188405] [2022-12-14 11:17:19,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:19,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:17:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:19,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:17:19,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:17:19,931 INFO L87 Difference]: Start difference. First operand 4445 states and 6273 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 11:17:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:20,266 INFO L93 Difference]: Finished difference Result 9143 states and 13089 transitions. [2022-12-14 11:17:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:17:20,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-12-14 11:17:20,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:20,290 INFO L225 Difference]: With dead ends: 9143 [2022-12-14 11:17:20,290 INFO L226 Difference]: Without dead ends: 6104 [2022-12-14 11:17:20,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:17:20,300 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 91 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:20,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 195 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:17:20,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6104 states. [2022-12-14 11:17:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6104 to 5297. [2022-12-14 11:17:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5297 states, 4025 states have (on average 1.324472049689441) internal successors, (5331), 4056 states have internal predecessors, (5331), 775 states have call successors, (775), 474 states have call predecessors, (775), 496 states have return successors, (1081), 767 states have call predecessors, (1081), 775 states have call successors, (1081) [2022-12-14 11:17:20,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5297 states to 5297 states and 7187 transitions. [2022-12-14 11:17:20,589 INFO L78 Accepts]: Start accepts. Automaton has 5297 states and 7187 transitions. Word has length 46 [2022-12-14 11:17:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:20,589 INFO L495 AbstractCegarLoop]: Abstraction has 5297 states and 7187 transitions. [2022-12-14 11:17:20,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 11:17:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5297 states and 7187 transitions. [2022-12-14 11:17:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 11:17:20,590 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:20,590 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] [2022-12-14 11:17:20,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 11:17:20,591 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:20,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:20,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1638708756, now seen corresponding path program 1 times [2022-12-14 11:17:20,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:20,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419035372] [2022-12-14 11:17:20,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 11:17:20,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:20,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419035372] [2022-12-14 11:17:20,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419035372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:20,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:20,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 11:17:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835944939] [2022-12-14 11:17:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:20,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:17:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:20,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:17:20,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:17:20,702 INFO L87 Difference]: Start difference. First operand 5297 states and 7187 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 11:17:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:21,723 INFO L93 Difference]: Finished difference Result 15607 states and 21161 transitions. [2022-12-14 11:17:21,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:17:21,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 58 [2022-12-14 11:17:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:21,775 INFO L225 Difference]: With dead ends: 15607 [2022-12-14 11:17:21,775 INFO L226 Difference]: Without dead ends: 10316 [2022-12-14 11:17:21,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:17:21,791 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 318 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:21,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 258 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:17:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10316 states. [2022-12-14 11:17:22,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10316 to 9538. [2022-12-14 11:17:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9538 states, 7238 states have (on average 1.3069908814589666) internal successors, (9460), 7283 states have internal predecessors, (9460), 1395 states have call successors, (1395), 864 states have call predecessors, (1395), 904 states have return successors, (1951), 1391 states have call predecessors, (1951), 1395 states have call successors, (1951) [2022-12-14 11:17:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9538 states to 9538 states and 12806 transitions. [2022-12-14 11:17:22,352 INFO L78 Accepts]: Start accepts. Automaton has 9538 states and 12806 transitions. Word has length 58 [2022-12-14 11:17:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:22,352 INFO L495 AbstractCegarLoop]: Abstraction has 9538 states and 12806 transitions. [2022-12-14 11:17:22,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-14 11:17:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9538 states and 12806 transitions. [2022-12-14 11:17:22,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 11:17:22,355 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:22,355 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] [2022-12-14 11:17:22,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 11:17:22,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:22,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1642649584, now seen corresponding path program 1 times [2022-12-14 11:17:22,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:22,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810779205] [2022-12-14 11:17:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:22,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 11:17:22,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:22,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810779205] [2022-12-14 11:17:22,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810779205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:22,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:22,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:17:22,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152489310] [2022-12-14 11:17:22,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:22,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:17:22,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:22,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:17:22,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:17:22,405 INFO L87 Difference]: Start difference. First operand 9538 states and 12806 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 11:17:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:23,204 INFO L93 Difference]: Finished difference Result 15440 states and 21062 transitions. [2022-12-14 11:17:23,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:17:23,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-12-14 11:17:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:23,246 INFO L225 Difference]: With dead ends: 15440 [2022-12-14 11:17:23,246 INFO L226 Difference]: Without dead ends: 11942 [2022-12-14 11:17:23,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:17:23,257 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 64 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:23,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 264 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:17:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11942 states. [2022-12-14 11:17:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11942 to 10180. [2022-12-14 11:17:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10180 states, 7790 states have (on average 1.3156611039794608) internal successors, (10249), 7835 states have internal predecessors, (10249), 1440 states have call successors, (1440), 909 states have call predecessors, (1440), 949 states have return successors, (1996), 1436 states have call predecessors, (1996), 1440 states have call successors, (1996) [2022-12-14 11:17:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10180 states to 10180 states and 13685 transitions. [2022-12-14 11:17:23,913 INFO L78 Accepts]: Start accepts. Automaton has 10180 states and 13685 transitions. Word has length 60 [2022-12-14 11:17:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:23,913 INFO L495 AbstractCegarLoop]: Abstraction has 10180 states and 13685 transitions. [2022-12-14 11:17:23,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-12-14 11:17:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 10180 states and 13685 transitions. [2022-12-14 11:17:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-14 11:17:23,921 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:23,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:17:23,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 11:17:23,921 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:23,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:23,922 INFO L85 PathProgramCache]: Analyzing trace with hash -139480883, now seen corresponding path program 1 times [2022-12-14 11:17:23,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:23,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549403834] [2022-12-14 11:17:23,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:23,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-14 11:17:23,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:23,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549403834] [2022-12-14 11:17:23,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549403834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:23,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:23,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:17:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151142922] [2022-12-14 11:17:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:23,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:17:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:23,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:17:23,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:17:23,973 INFO L87 Difference]: Start difference. First operand 10180 states and 13685 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-14 11:17:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:24,568 INFO L93 Difference]: Finished difference Result 21009 states and 28300 transitions. [2022-12-14 11:17:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:17:24,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 83 [2022-12-14 11:17:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:24,598 INFO L225 Difference]: With dead ends: 21009 [2022-12-14 11:17:24,598 INFO L226 Difference]: Without dead ends: 12190 [2022-12-14 11:17:24,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:17:24,615 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 84 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:24,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 200 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:17:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12190 states. [2022-12-14 11:17:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12190 to 7177. [2022-12-14 11:17:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7177 states, 5505 states have (on average 1.3059037238873752) internal successors, (7189), 5538 states have internal predecessors, (7189), 1016 states have call successors, (1016), 647 states have call predecessors, (1016), 655 states have return successors, (1280), 992 states have call predecessors, (1280), 1016 states have call successors, (1280) [2022-12-14 11:17:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7177 states to 7177 states and 9485 transitions. [2022-12-14 11:17:25,416 INFO L78 Accepts]: Start accepts. Automaton has 7177 states and 9485 transitions. Word has length 83 [2022-12-14 11:17:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:25,417 INFO L495 AbstractCegarLoop]: Abstraction has 7177 states and 9485 transitions. [2022-12-14 11:17:25,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-14 11:17:25,417 INFO L276 IsEmpty]: Start isEmpty. Operand 7177 states and 9485 transitions. [2022-12-14 11:17:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-14 11:17:25,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:25,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:17:25,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 11:17:25,427 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:25,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:25,427 INFO L85 PathProgramCache]: Analyzing trace with hash -510309236, now seen corresponding path program 1 times [2022-12-14 11:17:25,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:25,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815150524] [2022-12-14 11:17:25,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:25,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 11:17:25,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:25,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815150524] [2022-12-14 11:17:25,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815150524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:25,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:25,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 11:17:25,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153332788] [2022-12-14 11:17:25,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:25,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 11:17:25,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:25,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 11:17:25,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:17:25,735 INFO L87 Difference]: Start difference. First operand 7177 states and 9485 transitions. Second operand has 11 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-14 11:17:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:27,960 INFO L93 Difference]: Finished difference Result 28762 states and 39418 transitions. [2022-12-14 11:17:27,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 11:17:27,961 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 83 [2022-12-14 11:17:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:28,001 INFO L225 Difference]: With dead ends: 28762 [2022-12-14 11:17:28,002 INFO L226 Difference]: Without dead ends: 22907 [2022-12-14 11:17:28,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-12-14 11:17:28,015 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 868 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:28,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 384 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 11:17:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22907 states. [2022-12-14 11:17:29,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22907 to 16193. [2022-12-14 11:17:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16193 states, 12848 states have (on average 1.2909402241594023) internal successors, (16586), 12925 states have internal predecessors, (16586), 1904 states have call successors, (1904), 1416 states have call predecessors, (1904), 1440 states have return successors, (2451), 1852 states have call predecessors, (2451), 1904 states have call successors, (2451) [2022-12-14 11:17:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16193 states to 16193 states and 20941 transitions. [2022-12-14 11:17:29,559 INFO L78 Accepts]: Start accepts. Automaton has 16193 states and 20941 transitions. Word has length 83 [2022-12-14 11:17:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:29,560 INFO L495 AbstractCegarLoop]: Abstraction has 16193 states and 20941 transitions. [2022-12-14 11:17:29,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-14 11:17:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 16193 states and 20941 transitions. [2022-12-14 11:17:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-14 11:17:29,564 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:29,565 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, 1, 1, 1, 1, 1, 1, 1, 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-14 11:17:29,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 11:17:29,565 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:29,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:29,565 INFO L85 PathProgramCache]: Analyzing trace with hash 630042475, now seen corresponding path program 1 times [2022-12-14 11:17:29,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:29,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212046164] [2022-12-14 11:17:29,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:29,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 11:17:29,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:29,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212046164] [2022-12-14 11:17:29,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212046164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:29,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:29,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:17:29,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150520918] [2022-12-14 11:17:29,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:29,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:17:29,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:29,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:17:29,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:17:29,605 INFO L87 Difference]: Start difference. First operand 16193 states and 20941 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 11:17:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:30,988 INFO L93 Difference]: Finished difference Result 24601 states and 32632 transitions. [2022-12-14 11:17:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:17:30,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-12-14 11:17:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:31,018 INFO L225 Difference]: With dead ends: 24601 [2022-12-14 11:17:31,018 INFO L226 Difference]: Without dead ends: 16094 [2022-12-14 11:17:31,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:17:31,028 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 204 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:31,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 298 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:17:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16094 states. [2022-12-14 11:17:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16094 to 15916. [2022-12-14 11:17:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15916 states, 12589 states have (on average 1.268091190722059) internal successors, (15964), 12648 states have internal predecessors, (15964), 1904 states have call successors, (1904), 1416 states have call predecessors, (1904), 1422 states have return successors, (2415), 1852 states have call predecessors, (2415), 1904 states have call successors, (2415) [2022-12-14 11:17:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15916 states to 15916 states and 20283 transitions. [2022-12-14 11:17:32,242 INFO L78 Accepts]: Start accepts. Automaton has 15916 states and 20283 transitions. Word has length 83 [2022-12-14 11:17:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:32,242 INFO L495 AbstractCegarLoop]: Abstraction has 15916 states and 20283 transitions. [2022-12-14 11:17:32,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 11:17:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 15916 states and 20283 transitions. [2022-12-14 11:17:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 11:17:32,247 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:32,247 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:17:32,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 11:17:32,247 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:32,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash 564698622, now seen corresponding path program 1 times [2022-12-14 11:17:32,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:32,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004609174] [2022-12-14 11:17:32,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:32,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-14 11:17:32,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:32,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004609174] [2022-12-14 11:17:32,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004609174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:32,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:32,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:17:32,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161170209] [2022-12-14 11:17:32,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:32,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:17:32,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:32,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:17:32,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:17:32,293 INFO L87 Difference]: Start difference. First operand 15916 states and 20283 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-14 11:17:33,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:33,976 INFO L93 Difference]: Finished difference Result 30120 states and 38943 transitions. [2022-12-14 11:17:33,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:17:33,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-12-14 11:17:33,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:34,015 INFO L225 Difference]: With dead ends: 30120 [2022-12-14 11:17:34,015 INFO L226 Difference]: Without dead ends: 18974 [2022-12-14 11:17:34,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:17:34,033 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 55 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:34,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 253 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:17:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18974 states. [2022-12-14 11:17:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18974 to 17086. [2022-12-14 11:17:35,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17086 states, 13603 states have (on average 1.2791296037638755) internal successors, (17400), 13662 states have internal predecessors, (17400), 1982 states have call successors, (1982), 1494 states have call predecessors, (1982), 1500 states have return successors, (2493), 1930 states have call predecessors, (2493), 1982 states have call successors, (2493) [2022-12-14 11:17:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17086 states to 17086 states and 21875 transitions. [2022-12-14 11:17:35,465 INFO L78 Accepts]: Start accepts. Automaton has 17086 states and 21875 transitions. Word has length 84 [2022-12-14 11:17:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:35,466 INFO L495 AbstractCegarLoop]: Abstraction has 17086 states and 21875 transitions. [2022-12-14 11:17:35,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-14 11:17:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 17086 states and 21875 transitions. [2022-12-14 11:17:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 11:17:35,469 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:35,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:17:35,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 11:17:35,470 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:35,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:35,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1933608045, now seen corresponding path program 1 times [2022-12-14 11:17:35,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:35,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224810639] [2022-12-14 11:17:35,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:35,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 11:17:35,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:35,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224810639] [2022-12-14 11:17:35,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224810639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:35,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:35,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:17:35,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612124796] [2022-12-14 11:17:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:35,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:17:35,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:35,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:17:35,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:17:35,593 INFO L87 Difference]: Start difference. First operand 17086 states and 21875 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-14 11:17:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:37,240 INFO L93 Difference]: Finished difference Result 28104 states and 36122 transitions. [2022-12-14 11:17:37,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 11:17:37,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-12-14 11:17:37,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:37,275 INFO L225 Difference]: With dead ends: 28104 [2022-12-14 11:17:37,275 INFO L226 Difference]: Without dead ends: 20978 [2022-12-14 11:17:37,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:17:37,288 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 87 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:37,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 356 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:17:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20978 states. [2022-12-14 11:17:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20978 to 20271. [2022-12-14 11:17:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20271 states, 16101 states have (on average 1.2650145953667473) internal successors, (20368), 16130 states have internal predecessors, (20368), 2405 states have call successors, (2405), 1803 states have call predecessors, (2405), 1764 states have return successors, (3103), 2338 states have call predecessors, (3103), 2405 states have call successors, (3103) [2022-12-14 11:17:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20271 states to 20271 states and 25876 transitions. [2022-12-14 11:17:39,110 INFO L78 Accepts]: Start accepts. Automaton has 20271 states and 25876 transitions. Word has length 84 [2022-12-14 11:17:39,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:39,111 INFO L495 AbstractCegarLoop]: Abstraction has 20271 states and 25876 transitions. [2022-12-14 11:17:39,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-14 11:17:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 20271 states and 25876 transitions. [2022-12-14 11:17:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 11:17:39,122 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:39,123 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:17:39,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 11:17:39,123 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2098151107, now seen corresponding path program 1 times [2022-12-14 11:17:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:39,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102253160] [2022-12-14 11:17:39,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 11:17:39,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:39,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102253160] [2022-12-14 11:17:39,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102253160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:39,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:39,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 11:17:39,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951814966] [2022-12-14 11:17:39,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:39,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 11:17:39,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:39,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 11:17:39,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 11:17:39,303 INFO L87 Difference]: Start difference. First operand 20271 states and 25876 transitions. Second operand has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 11:17:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:41,240 INFO L93 Difference]: Finished difference Result 29981 states and 39007 transitions. [2022-12-14 11:17:41,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:17:41,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 108 [2022-12-14 11:17:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:41,277 INFO L225 Difference]: With dead ends: 29981 [2022-12-14 11:17:41,277 INFO L226 Difference]: Without dead ends: 21675 [2022-12-14 11:17:41,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:17:41,293 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 214 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:41,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 187 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:17:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21675 states. [2022-12-14 11:17:42,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21675 to 21605. [2022-12-14 11:17:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21605 states, 17322 states have (on average 1.2474887426394181) internal successors, (21609), 17399 states have internal predecessors, (21609), 2405 states have call successors, (2405), 1868 states have call predecessors, (2405), 1877 states have return successors, (3095), 2338 states have call predecessors, (3095), 2405 states have call successors, (3095) [2022-12-14 11:17:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21605 states to 21605 states and 27109 transitions. [2022-12-14 11:17:43,024 INFO L78 Accepts]: Start accepts. Automaton has 21605 states and 27109 transitions. Word has length 108 [2022-12-14 11:17:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:43,025 INFO L495 AbstractCegarLoop]: Abstraction has 21605 states and 27109 transitions. [2022-12-14 11:17:43,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 11:17:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 21605 states and 27109 transitions. [2022-12-14 11:17:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-12-14 11:17:43,036 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:43,036 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:17:43,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 11:17:43,036 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1984764450, now seen corresponding path program 1 times [2022-12-14 11:17:43,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:43,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141456767] [2022-12-14 11:17:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 11:17:43,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:43,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141456767] [2022-12-14 11:17:43,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141456767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:43,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:43,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 11:17:43,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719592497] [2022-12-14 11:17:43,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:43,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 11:17:43,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:43,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 11:17:43,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:17:43,077 INFO L87 Difference]: Start difference. First operand 21605 states and 27109 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 11:17:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:45,007 INFO L93 Difference]: Finished difference Result 34573 states and 44182 transitions. [2022-12-14 11:17:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 11:17:45,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 108 [2022-12-14 11:17:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:45,043 INFO L225 Difference]: With dead ends: 34573 [2022-12-14 11:17:45,043 INFO L226 Difference]: Without dead ends: 20822 [2022-12-14 11:17:45,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:17:45,066 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 191 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:45,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 284 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:17:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20822 states. [2022-12-14 11:17:46,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20822 to 20664. [2022-12-14 11:17:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20664 states, 16602 states have (on average 1.2273220093964583) internal successors, (20376), 16624 states have internal predecessors, (20376), 2262 states have call successors, (2262), 1766 states have call predecessors, (2262), 1799 states have return successors, (2848), 2274 states have call predecessors, (2848), 2262 states have call successors, (2848) [2022-12-14 11:17:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20664 states to 20664 states and 25486 transitions. [2022-12-14 11:17:47,025 INFO L78 Accepts]: Start accepts. Automaton has 20664 states and 25486 transitions. Word has length 108 [2022-12-14 11:17:47,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:47,025 INFO L495 AbstractCegarLoop]: Abstraction has 20664 states and 25486 transitions. [2022-12-14 11:17:47,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-14 11:17:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 20664 states and 25486 transitions. [2022-12-14 11:17:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 11:17:47,040 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:47,040 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:17:47,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 11:17:47,040 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:47,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:47,040 INFO L85 PathProgramCache]: Analyzing trace with hash 976856883, now seen corresponding path program 1 times [2022-12-14 11:17:47,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:47,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811925715] [2022-12-14 11:17:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:47,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-12-14 11:17:47,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:47,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811925715] [2022-12-14 11:17:47,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811925715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:17:47,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:17:47,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 11:17:47,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886951654] [2022-12-14 11:17:47,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:17:47,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:17:47,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:17:47,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:17:47,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:17:47,109 INFO L87 Difference]: Start difference. First operand 20664 states and 25486 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 11:17:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:17:49,126 INFO L93 Difference]: Finished difference Result 41555 states and 51628 transitions. [2022-12-14 11:17:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:17:49,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 109 [2022-12-14 11:17:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:17:49,166 INFO L225 Difference]: With dead ends: 41555 [2022-12-14 11:17:49,166 INFO L226 Difference]: Without dead ends: 22976 [2022-12-14 11:17:49,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 11:17:49,187 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 46 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:17:49,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 244 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:17:49,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22976 states. [2022-12-14 11:17:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22976 to 21468. [2022-12-14 11:17:50,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21468 states, 17286 states have (on average 1.2306490801804928) internal successors, (21273), 17308 states have internal predecessors, (21273), 2322 states have call successors, (2322), 1826 states have call predecessors, (2322), 1859 states have return successors, (2908), 2334 states have call predecessors, (2908), 2322 states have call successors, (2908) [2022-12-14 11:17:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21468 states to 21468 states and 26503 transitions. [2022-12-14 11:17:50,994 INFO L78 Accepts]: Start accepts. Automaton has 21468 states and 26503 transitions. Word has length 109 [2022-12-14 11:17:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:17:50,994 INFO L495 AbstractCegarLoop]: Abstraction has 21468 states and 26503 transitions. [2022-12-14 11:17:50,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 11:17:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 21468 states and 26503 transitions. [2022-12-14 11:17:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 11:17:51,005 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:17:51,005 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:17:51,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 11:17:51,005 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:17:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:17:51,005 INFO L85 PathProgramCache]: Analyzing trace with hash -583237671, now seen corresponding path program 1 times [2022-12-14 11:17:51,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:17:51,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902358773] [2022-12-14 11:17:51,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:51,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:17:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 11:17:51,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:17:51,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902358773] [2022-12-14 11:17:51,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902358773] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:17:51,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329474379] [2022-12-14 11:17:51,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:17:51,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:17:51,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:17:51,078 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:17:51,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 11:17:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:17:51,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 11:17:51,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:17:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 11:17:51,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:17:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 11:17:51,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329474379] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:17:51,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1550206890] [2022-12-14 11:17:51,589 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2022-12-14 11:17:51,589 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:17:51,591 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:17:51,596 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:17:51,596 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:17:54,346 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 87 for LOIs [2022-12-14 11:17:54,362 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-12-14 11:17:54,380 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2022-12-14 11:17:56,827 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 88 for LOIs [2022-12-14 11:17:56,839 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 74 for LOIs [2022-12-14 11:17:56,842 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 28 for LOIs [2022-12-14 11:17:56,847 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 56 for LOIs [2022-12-14 11:17:56,947 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 53 for LOIs [2022-12-14 11:17:57,151 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 11:18:04,997 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '667536#(and (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_4~0#1| 2147483648)) (= ~t1_i~0 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_3~0#1| 2147483648)) (= ~t3_st~0 1) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_eval_~tmp~0#1| 1) (<= |ULTIMATE.start_eval_~tmp_ndt_4~0#1| 2147483647) (<= |ULTIMATE.start_eval_~tmp_ndt_3~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (<= ~t1_pc~0 0) (<= |#NULL.offset| 0) (<= ~t2_pc~0 1) (<= ~m_pc~0 1) (<= 1 ~t2_pc~0) (<= 1 ~m_i~0) (= ~t2_i~0 1) (<= ~t2_st~0 2) (<= ~m_i~0 1) (<= 0 |ULTIMATE.start_eval_~tmp_ndt_2~0#1|) (<= |ULTIMATE.start_eval_~tmp_ndt_2~0#1| 0) (<= 0 ~m_pc~0) (<= 2 ~t2_st~0) (<= 0 |#NULL.offset|) (= ~t3_i~0 1) (= ~t3_pc~0 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-12-14 11:18:04,997 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 11:18:04,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:18:04,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 4] total 10 [2022-12-14 11:18:04,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685451768] [2022-12-14 11:18:04,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:18:04,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 11:18:04,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:18:04,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 11:18:04,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=3243, Unknown=0, NotChecked=0, Total=3540 [2022-12-14 11:18:04,999 INFO L87 Difference]: Start difference. First operand 21468 states and 26503 transitions. Second operand has 10 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 5 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-12-14 11:18:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:18:08,996 INFO L93 Difference]: Finished difference Result 55374 states and 69897 transitions. [2022-12-14 11:18:08,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 11:18:08,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 5 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) Word has length 109 [2022-12-14 11:18:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:18:09,063 INFO L225 Difference]: With dead ends: 55374 [2022-12-14 11:18:09,064 INFO L226 Difference]: Without dead ends: 38794 [2022-12-14 11:18:09,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 267 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=353, Invalid=3937, Unknown=0, NotChecked=0, Total=4290 [2022-12-14 11:18:09,093 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 471 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 11:18:09,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 266 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 11:18:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38794 states. [2022-12-14 11:18:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38794 to 36195. [2022-12-14 11:18:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36195 states, 29216 states have (on average 1.2192976451259583) internal successors, (35623), 29253 states have internal predecessors, (35623), 3869 states have call successors, (3869), 3061 states have call predecessors, (3869), 3109 states have return successors, (4589), 3881 states have call predecessors, (4589), 3869 states have call successors, (4589) [2022-12-14 11:18:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36195 states to 36195 states and 44081 transitions. [2022-12-14 11:18:12,440 INFO L78 Accepts]: Start accepts. Automaton has 36195 states and 44081 transitions. Word has length 109 [2022-12-14 11:18:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:18:12,440 INFO L495 AbstractCegarLoop]: Abstraction has 36195 states and 44081 transitions. [2022-12-14 11:18:12,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 16.5) internal successors, (132), 8 states have internal predecessors, (132), 5 states have call successors, (17), 6 states have call predecessors, (17), 8 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) [2022-12-14 11:18:12,440 INFO L276 IsEmpty]: Start isEmpty. Operand 36195 states and 44081 transitions. [2022-12-14 11:18:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 11:18:12,452 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:18:12,453 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:18:12,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:18:12,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 11:18:12,654 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:18:12,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:18:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash -280111047, now seen corresponding path program 1 times [2022-12-14 11:18:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:18:12,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682674465] [2022-12-14 11:18:12,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:18:12,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:18:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:18:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 11:18:12,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:18:12,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682674465] [2022-12-14 11:18:12,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682674465] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:18:12,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934314498] [2022-12-14 11:18:12,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:18:12,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:18:12,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:18:12,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:18:12,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 11:18:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:18:12,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 11:18:12,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:18:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 11:18:12,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:18:12,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934314498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:18:12,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:18:12,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-14 11:18:12,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383173883] [2022-12-14 11:18:12,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:18:12,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:18:12,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:18:12,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:18:12,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:18:12,823 INFO L87 Difference]: Start difference. First operand 36195 states and 44081 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-14 11:18:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:18:15,959 INFO L93 Difference]: Finished difference Result 60431 states and 74940 transitions. [2022-12-14 11:18:15,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:18:15,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 109 [2022-12-14 11:18:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:18:16,018 INFO L225 Difference]: With dead ends: 60431 [2022-12-14 11:18:16,018 INFO L226 Difference]: Without dead ends: 34108 [2022-12-14 11:18:16,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:18:16,051 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 82 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:18:16,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 258 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:18:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34108 states. [2022-12-14 11:18:19,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34108 to 33621. [2022-12-14 11:18:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33621 states, 27126 states have (on average 1.192656491926565) internal successors, (32352), 27151 states have internal predecessors, (32352), 3609 states have call successors, (3609), 2861 states have call predecessors, (3609), 2885 states have return successors, (4133), 3609 states have call predecessors, (4133), 3609 states have call successors, (4133) [2022-12-14 11:18:19,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33621 states to 33621 states and 40094 transitions. [2022-12-14 11:18:19,314 INFO L78 Accepts]: Start accepts. Automaton has 33621 states and 40094 transitions. Word has length 109 [2022-12-14 11:18:19,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:18:19,314 INFO L495 AbstractCegarLoop]: Abstraction has 33621 states and 40094 transitions. [2022-12-14 11:18:19,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-14 11:18:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 33621 states and 40094 transitions. [2022-12-14 11:18:19,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 11:18:19,323 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:18:19,323 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:18:19,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 11:18:19,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 11:18:19,525 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:18:19,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:18:19,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1564203481, now seen corresponding path program 1 times [2022-12-14 11:18:19,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:18:19,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104261875] [2022-12-14 11:18:19,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:18:19,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:18:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:18:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 29 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 11:18:19,644 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:18:19,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104261875] [2022-12-14 11:18:19,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104261875] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:18:19,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589762545] [2022-12-14 11:18:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:18:19,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:18:19,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:18:19,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:18:19,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 11:18:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:18:19,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 11:18:19,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:18:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:18:19,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:18:19,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589762545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:18:19,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:18:19,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-12-14 11:18:19,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196587450] [2022-12-14 11:18:19,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:18:19,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 11:18:19,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:18:19,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 11:18:19,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:18:19,787 INFO L87 Difference]: Start difference. First operand 33621 states and 40094 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-14 11:18:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:18:23,011 INFO L93 Difference]: Finished difference Result 51673 states and 61628 transitions. [2022-12-14 11:18:23,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 11:18:23,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 111 [2022-12-14 11:18:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:18:23,067 INFO L225 Difference]: With dead ends: 51673 [2022-12-14 11:18:23,067 INFO L226 Difference]: Without dead ends: 33286 [2022-12-14 11:18:23,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 11:18:23,089 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 192 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 11:18:23,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 409 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 11:18:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33286 states. [2022-12-14 11:18:26,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33286 to 31829. [2022-12-14 11:18:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31829 states, 25576 states have (on average 1.182671254300907) internal successors, (30248), 25613 states have internal predecessors, (30248), 3476 states have call successors, (3476), 2740 states have call predecessors, (3476), 2776 states have return successors, (4036), 3476 states have call predecessors, (4036), 3476 states have call successors, (4036) [2022-12-14 11:18:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31829 states to 31829 states and 37760 transitions. [2022-12-14 11:18:26,291 INFO L78 Accepts]: Start accepts. Automaton has 31829 states and 37760 transitions. Word has length 111 [2022-12-14 11:18:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:18:26,292 INFO L495 AbstractCegarLoop]: Abstraction has 31829 states and 37760 transitions. [2022-12-14 11:18:26,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-12-14 11:18:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 31829 states and 37760 transitions. [2022-12-14 11:18:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 11:18:26,304 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:18:26,304 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:18:26,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 11:18:26,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:18:26,505 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:18:26,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:18:26,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1924814754, now seen corresponding path program 1 times [2022-12-14 11:18:26,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:18:26,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296667494] [2022-12-14 11:18:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:18:26,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:18:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:18:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-12-14 11:18:26,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:18:26,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296667494] [2022-12-14 11:18:26,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296667494] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:18:26,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834636432] [2022-12-14 11:18:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:18:26,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:18:26,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:18:26,586 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:18:26,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 11:18:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:18:26,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 11:18:26,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:18:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 11:18:26,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:18:26,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834636432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:18:26,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:18:26,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-14 11:18:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243659290] [2022-12-14 11:18:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:18:26,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:18:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:18:26,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:18:26,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:18:26,722 INFO L87 Difference]: Start difference. First operand 31829 states and 37760 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-14 11:18:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:18:28,475 INFO L93 Difference]: Finished difference Result 48876 states and 58659 transitions. [2022-12-14 11:18:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:18:28,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 137 [2022-12-14 11:18:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:18:28,505 INFO L225 Difference]: With dead ends: 48876 [2022-12-14 11:18:28,505 INFO L226 Difference]: Without dead ends: 18425 [2022-12-14 11:18:28,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 11:18:28,538 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 56 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:18:28,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 232 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:18:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18425 states. [2022-12-14 11:18:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18425 to 18341. [2022-12-14 11:18:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18341 states, 14802 states have (on average 1.1697067963788677) internal successors, (17314), 14821 states have internal predecessors, (17314), 1960 states have call successors, (1960), 1560 states have call predecessors, (1960), 1578 states have return successors, (2008), 1960 states have call predecessors, (2008), 1960 states have call successors, (2008) [2022-12-14 11:18:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18341 states to 18341 states and 21282 transitions. [2022-12-14 11:18:30,231 INFO L78 Accepts]: Start accepts. Automaton has 18341 states and 21282 transitions. Word has length 137 [2022-12-14 11:18:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:18:30,232 INFO L495 AbstractCegarLoop]: Abstraction has 18341 states and 21282 transitions. [2022-12-14 11:18:30,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-14 11:18:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 18341 states and 21282 transitions. [2022-12-14 11:18:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-12-14 11:18:30,243 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:18:30,244 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:18:30,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 11:18:30,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:18:30,446 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:18:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:18:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1723481564, now seen corresponding path program 2 times [2022-12-14 11:18:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:18:30,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894509905] [2022-12-14 11:18:30,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:18:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:18:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:18:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-14 11:18:30,520 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:18:30,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894509905] [2022-12-14 11:18:30,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894509905] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:18:30,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628636939] [2022-12-14 11:18:30,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:18:30,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:18:30,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:18:30,522 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:18:30,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 11:18:30,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 11:18:30,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:18:30,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 11:18:30,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:18:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-14 11:18:30,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:18:30,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628636939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:18:30,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 11:18:30,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-14 11:18:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386224259] [2022-12-14 11:18:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:18:30,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 11:18:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:18:30,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 11:18:30,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:18:30,655 INFO L87 Difference]: Start difference. First operand 18341 states and 21282 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-14 11:18:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:18:32,658 INFO L93 Difference]: Finished difference Result 34370 states and 40318 transitions. [2022-12-14 11:18:32,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 11:18:32,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 137 [2022-12-14 11:18:32,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:18:32,689 INFO L225 Difference]: With dead ends: 34370 [2022-12-14 11:18:32,689 INFO L226 Difference]: Without dead ends: 18341 [2022-12-14 11:18:32,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:18:32,712 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 77 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:18:32,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 124 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:18:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18341 states. [2022-12-14 11:18:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18341 to 18341. [2022-12-14 11:18:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18341 states, 14802 states have (on average 1.1472098365085799) internal successors, (16981), 14821 states have internal predecessors, (16981), 1960 states have call successors, (1960), 1560 states have call predecessors, (1960), 1578 states have return successors, (2008), 1960 states have call predecessors, (2008), 1960 states have call successors, (2008) [2022-12-14 11:18:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18341 states to 18341 states and 20949 transitions. [2022-12-14 11:18:34,457 INFO L78 Accepts]: Start accepts. Automaton has 18341 states and 20949 transitions. Word has length 137 [2022-12-14 11:18:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:18:34,457 INFO L495 AbstractCegarLoop]: Abstraction has 18341 states and 20949 transitions. [2022-12-14 11:18:34,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2022-12-14 11:18:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 18341 states and 20949 transitions. [2022-12-14 11:18:34,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-12-14 11:18:34,464 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:18:34,465 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 11:18:34,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 11:18:34,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:18:34,666 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:18:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:18:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash -965718814, now seen corresponding path program 1 times [2022-12-14 11:18:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:18:34,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754812406] [2022-12-14 11:18:34,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:18:34,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:18:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 11:18:34,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 11:18:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 11:18:34,733 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 11:18:34,733 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 11:18:34,734 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 11:18:34,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 11:18:34,737 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:18:34,740 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 11:18:34,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 11:18:34 BoogieIcfgContainer [2022-12-14 11:18:34,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 11:18:34,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 11:18:34,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 11:18:34,804 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 11:18:34,804 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:17:16" (3/4) ... [2022-12-14 11:18:34,806 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 11:18:34,878 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 11:18:34,878 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 11:18:34,879 INFO L158 Benchmark]: Toolchain (without parser) took 79488.37ms. Allocated memory was 125.8MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 91.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-12-14 11:18:34,879 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory was 79.8MB in the beginning and 79.7MB in the end (delta: 91.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:18:34,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.88ms. Allocated memory is still 125.8MB. Free memory was 91.0MB in the beginning and 76.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 11:18:34,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.32ms. Allocated memory is still 125.8MB. Free memory was 76.8MB in the beginning and 74.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:18:34,880 INFO L158 Benchmark]: Boogie Preprocessor took 21.14ms. Allocated memory is still 125.8MB. Free memory was 74.3MB in the beginning and 72.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:18:34,880 INFO L158 Benchmark]: RCFGBuilder took 529.00ms. Allocated memory is still 125.8MB. Free memory was 72.2MB in the beginning and 72.5MB in the end (delta: -341.5kB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2022-12-14 11:18:34,880 INFO L158 Benchmark]: TraceAbstraction took 78543.39ms. Allocated memory was 125.8MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 71.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-12-14 11:18:34,881 INFO L158 Benchmark]: Witness Printer took 74.60ms. Allocated memory is still 3.7GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 11:18:34,882 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.13ms. Allocated memory is still 104.9MB. Free memory was 79.8MB in the beginning and 79.7MB in the end (delta: 91.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.88ms. Allocated memory is still 125.8MB. Free memory was 91.0MB in the beginning and 76.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.32ms. Allocated memory is still 125.8MB. Free memory was 76.8MB in the beginning and 74.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.14ms. Allocated memory is still 125.8MB. Free memory was 74.3MB in the beginning and 72.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 529.00ms. Allocated memory is still 125.8MB. Free memory was 72.2MB in the beginning and 72.5MB in the end (delta: -341.5kB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 78543.39ms. Allocated memory was 125.8MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 71.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 74.60ms. Allocated memory is still 3.7GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int t3_pc = 0; [L29] int m_st ; [L30] int t1_st ; [L31] int t2_st ; [L32] int t3_st ; [L33] int m_i ; [L34] int t1_i ; [L35] int t2_i ; [L36] int t3_i ; [L37] int M_E = 2; [L38] int T1_E = 2; [L39] int T2_E = 2; [L40] int T3_E = 2; [L41] int E_1 = 2; [L42] int E_2 = 2; [L43] int E_3 = 2; [L697] int __retres1 ; [L701] CALL init_model() [L610] m_i = 1 [L611] t1_i = 1 [L612] t2_i = 1 [L613] t3_i = 1 [L701] RET init_model() [L702] CALL start_simulation() [L638] int kernel_st ; [L639] int tmp ; [L640] int tmp___0 ; [L644] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L645] FCALL update_channels() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L646] CALL init_threads() [L281] COND TRUE m_i == 1 [L282] m_st = 0 [L286] COND TRUE t1_i == 1 [L287] t1_st = 0 [L291] COND TRUE t2_i == 1 [L292] t2_st = 0 [L296] COND TRUE t3_i == 1 [L297] t3_st = 0 [L646] RET init_threads() [L647] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L418] COND FALSE !(M_E == 0) [L423] COND FALSE !(T1_E == 0) [L428] COND FALSE !(T2_E == 0) [L433] COND FALSE !(T3_E == 0) [L438] COND FALSE !(E_1 == 0) [L443] COND FALSE !(E_2 == 0) [L448] COND FALSE !(E_3 == 0) [L647] RET fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L648] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L197] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L207] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L216] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L226] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L235] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L245] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L254] COND FALSE !(t3_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L264] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L648] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L649] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L461] COND FALSE !(M_E == 1) [L466] COND FALSE !(T1_E == 1) [L471] COND FALSE !(T2_E == 1) [L476] COND FALSE !(T3_E == 1) [L481] COND FALSE !(E_1 == 1) [L486] COND FALSE !(E_2 == 1) [L491] COND FALSE !(E_3 == 1) [L649] RET reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L652] COND TRUE 1 [L655] kernel_st = 1 [L656] CALL eval() [L337] int tmp ; VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L306] int __retres1 ; [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 [L332] return (__retres1); [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0] [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 [L371] CALL transmit1() [L94] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 [L371] RET transmit1() [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 [L385] CALL transmit2() [L129] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0] [L140] COND TRUE 1 [L142] t2_pc = 1 [L143] t2_st = 2 [L385] RET transmit2() [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1] [L175] COND TRUE 1 [L177] t3_pc = 1 [L178] t3_st = 2 [L399] RET transmit3() [L341] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L344] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L306] int __retres1 ; [L309] COND TRUE m_st == 0 [L310] __retres1 = 1 [L332] return (__retres1); [L344] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L344] tmp = exists_runnable_thread() [L346] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1, tmp_ndt_4=1] [L351] COND TRUE m_st == 0 [L352] int tmp_ndt_1; [L353] tmp_ndt_1 = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp_ndt_1) [L356] m_st = 1 [L357] CALL master() [L53] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L64] COND TRUE 1 [L67] E_1 = 1 VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L68] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND TRUE E_1 == 1 [L218] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND TRUE \read(tmp___0) [L519] t1_st = 0 [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L548] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L68] RET immediate_notify() VAL [E_1=1, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L69] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L72] COND TRUE 1 [L74] m_pc = 1 [L75] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L357] RET master() [L365] COND TRUE t1_st == 0 [L366] int tmp_ndt_2; [L367] tmp_ndt_2 = __VERIFIER_nondet_int() [L368] COND TRUE \read(tmp_ndt_2) [L370] t1_st = 1 [L371] CALL transmit1() [L94] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L97] COND TRUE t1_pc == 1 [L113] E_2 = 1 VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L114] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND TRUE E_2 == 1 [L237] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND TRUE \read(tmp___1) [L527] t2_st = 0 [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L264] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND FALSE !(\read(tmp___2)) [L548] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L114] RET immediate_notify() VAL [E_1=2, E_2=1, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L115] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L105] COND TRUE 1 [L107] t1_pc = 1 [L108] t1_st = 2 [L371] RET transmit1() [L379] COND TRUE t2_st == 0 [L380] int tmp_ndt_3; [L381] tmp_ndt_3 = __VERIFIER_nondet_int() [L382] COND TRUE \read(tmp_ndt_3) [L384] t2_st = 1 [L385] CALL transmit2() [L129] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L132] COND TRUE t2_pc == 1 [L148] E_3 = 1 VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L149] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L548] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L501] int tmp ; [L502] int tmp___0 ; [L503] int tmp___1 ; [L504] int tmp___2 ; [L508] CALL, EXPR is_master_triggered() [L194] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L197] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L198] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L207] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L209] return (__retres1); [L508] RET, EXPR is_master_triggered() [L508] tmp = is_master_triggered() [L510] COND FALSE !(\read(tmp)) [L516] CALL, EXPR is_transmit1_triggered() [L213] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L216] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L217] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L226] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L228] return (__retres1); [L516] RET, EXPR is_transmit1_triggered() [L516] tmp___0 = is_transmit1_triggered() [L518] COND FALSE !(\read(tmp___0)) [L524] CALL, EXPR is_transmit2_triggered() [L232] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L235] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L236] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L245] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L247] return (__retres1); [L524] RET, EXPR is_transmit2_triggered() [L524] tmp___1 = is_transmit2_triggered() [L526] COND FALSE !(\read(tmp___1)) [L532] CALL, EXPR is_transmit3_triggered() [L251] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L254] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L255] COND TRUE E_3 == 1 [L256] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2] [L266] return (__retres1); [L532] RET, EXPR is_transmit3_triggered() [L532] tmp___2 = is_transmit3_triggered() [L534] COND TRUE \read(tmp___2) [L535] t3_st = 0 [L548] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L149] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L150] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0] [L140] COND TRUE 1 [L142] t2_pc = 1 [L143] t2_st = 2 [L385] RET transmit2() [L393] COND TRUE t3_st == 0 [L394] int tmp_ndt_4; [L395] tmp_ndt_4 = __VERIFIER_nondet_int() [L396] COND TRUE \read(tmp_ndt_4) [L398] t3_st = 1 [L399] CALL transmit3() [L164] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] [L167] COND TRUE t3_pc == 1 [L183] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, E_3=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 78.4s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 32.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4865 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4771 mSDsluCounter, 6127 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3157 mSDsCounter, 1134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3912 IncrementalHoareTripleChecker+Invalid, 5046 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1134 mSolverCounterUnsat, 2970 mSDtfsCounter, 3912 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 998 GetRequests, 834 SyntacticMatches, 7 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1788 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36195occurred in iteration=17, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 25188 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2463 NumberOfCodeBlocks, 2413 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2406 ConstructedInterpolants, 0 QuantifiedInterpolants, 4397 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2564 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 27 InterpolantComputations, 20 PerfectInterpolantSequences, 1141/1210 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-14 11:18:34,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48699624-6834-4bcb-bfbe-29f089ce76d2/bin/utaipan-gh47qXpMRh/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