./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix014.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix014.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0 --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 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd --- 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-e04fb08 [2022-11-16 20:34:50,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 20:34:50,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 20:34:51,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 20:34:51,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 20:34:51,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 20:34:51,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 20:34:51,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 20:34:51,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 20:34:51,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 20:34:51,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 20:34:51,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 20:34:51,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 20:34:51,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 20:34:51,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 20:34:51,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 20:34:51,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 20:34:51,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 20:34:51,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 20:34:51,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 20:34:51,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 20:34:51,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 20:34:51,076 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 20:34:51,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 20:34:51,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 20:34:51,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 20:34:51,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 20:34:51,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 20:34:51,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 20:34:51,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 20:34:51,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 20:34:51,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 20:34:51,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 20:34:51,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 20:34:51,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 20:34:51,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 20:34:51,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 20:34:51,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 20:34:51,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 20:34:51,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 20:34:51,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 20:34:51,104 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 20:34:51,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 20:34:51,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 20:34:51,143 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 20:34:51,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 20:34:51,144 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 20:34:51,144 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 20:34:51,144 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 20:34:51,144 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 20:34:51,145 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 20:34:51,145 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 20:34:51,145 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 20:34:51,145 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 20:34:51,145 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 20:34:51,146 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 20:34:51,146 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 20:34:51,146 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 20:34:51,146 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 20:34:51,146 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 20:34:51,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 20:34:51,147 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 20:34:51,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 20:34:51,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 20:34:51,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 20:34:51,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 20:34:51,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 20:34:51,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 20:34:51,149 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 20:34:51,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 20:34:51,149 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 20:34:51,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 20:34:51,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 20:34:51,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 20:34:51,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:34:51,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 20:34:51,151 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 20:34:51,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 20:34:51,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 20:34:51,151 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 20:34:51,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 20:34:51,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 20:34:51,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 20:34:51,152 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_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/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_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0 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 -> 615dc0a4278e77a094a63ed4629507c6f8d1cda73abba57cd69e8912d83fe5fd [2022-11-16 20:34:51,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 20:34:51,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 20:34:51,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 20:34:51,493 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 20:34:51,494 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 20:34:51,495 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread-wmm/mix014.opt.i [2022-11-16 20:34:51,579 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/data/14c9b3aab/715ecb10892741589c63110252834682/FLAG5032009d7 [2022-11-16 20:34:52,202 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 20:34:52,203 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/sv-benchmarks/c/pthread-wmm/mix014.opt.i [2022-11-16 20:34:52,222 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/data/14c9b3aab/715ecb10892741589c63110252834682/FLAG5032009d7 [2022-11-16 20:34:52,468 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/data/14c9b3aab/715ecb10892741589c63110252834682 [2022-11-16 20:34:52,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 20:34:52,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 20:34:52,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 20:34:52,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 20:34:52,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 20:34:52,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:34:52" (1/1) ... [2022-11-16 20:34:52,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243f97cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:52, skipping insertion in model container [2022-11-16 20:34:52,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:34:52" (1/1) ... [2022-11-16 20:34:52,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 20:34:52,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 20:34:52,743 WARN L229 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_c2e071e3-eaf6-4d0c-b868-804706c4dd60/sv-benchmarks/c/pthread-wmm/mix014.opt.i[944,957] [2022-11-16 20:34:53,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:34:53,067 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 20:34:53,083 WARN L229 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_c2e071e3-eaf6-4d0c-b868-804706c4dd60/sv-benchmarks/c/pthread-wmm/mix014.opt.i[944,957] [2022-11-16 20:34:53,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:34:53,200 INFO L208 MainTranslator]: Completed translation [2022-11-16 20:34:53,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53 WrapperNode [2022-11-16 20:34:53,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 20:34:53,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 20:34:53,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 20:34:53,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 20:34:53,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53" (1/1) ... [2022-11-16 20:34:53,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53" (1/1) ... [2022-11-16 20:34:53,278 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-11-16 20:34:53,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 20:34:53,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 20:34:53,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 20:34:53,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 20:34:53,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53" (1/1) ... [2022-11-16 20:34:53,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53" (1/1) ... [2022-11-16 20:34:53,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53" (1/1) ... [2022-11-16 20:34:53,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53" (1/1) ... [2022-11-16 20:34:53,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53" (1/1) ... [2022-11-16 20:34:53,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53" (1/1) ... [2022-11-16 20:34:53,340 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53" (1/1) ... [2022-11-16 20:34:53,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53" (1/1) ... [2022-11-16 20:34:53,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 20:34:53,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 20:34:53,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 20:34:53,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 20:34:53,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53" (1/1) ... [2022-11-16 20:34:53,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:34:53,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:34:53,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 20:34:53,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 20:34:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 20:34:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 20:34:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 20:34:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 20:34:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 20:34:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 20:34:53,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 20:34:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 20:34:53,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 20:34:53,438 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 20:34:53,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 20:34:53,438 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 20:34:53,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 20:34:53,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 20:34:53,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 20:34:53,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 20:34:53,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 20:34:53,440 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 20:34:53,619 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 20:34:53,621 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 20:34:53,973 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 20:34:54,223 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 20:34:54,224 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 20:34:54,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:34:54 BoogieIcfgContainer [2022-11-16 20:34:54,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 20:34:54,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 20:34:54,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 20:34:54,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 20:34:54,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:34:52" (1/3) ... [2022-11-16 20:34:54,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62820d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:34:54, skipping insertion in model container [2022-11-16 20:34:54,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:34:53" (2/3) ... [2022-11-16 20:34:54,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62820d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:34:54, skipping insertion in model container [2022-11-16 20:34:54,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:34:54" (3/3) ... [2022-11-16 20:34:54,258 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014.opt.i [2022-11-16 20:34:54,269 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 20:34:54,305 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 20:34:54,305 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 20:34:54,305 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 20:34:54,403 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 20:34:54,452 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 20:34:54,468 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 294 flow [2022-11-16 20:34:54,471 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 294 flow [2022-11-16 20:34:54,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-16 20:34:54,540 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-16 20:34:54,541 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 20:34:54,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-16 20:34:54,550 INFO L119 LiptonReduction]: Number of co-enabled transitions 3074 [2022-11-16 20:34:59,858 INFO L134 LiptonReduction]: Checked pairs total: 8139 [2022-11-16 20:34:59,858 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-11-16 20:34:59,867 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2022-11-16 20:35:00,102 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3170 states, 3167 states have (on average 4.07136090937796) internal successors, (12894), 3169 states have internal predecessors, (12894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:00,132 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 20:35:00,141 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;@3b571420, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 20:35:00,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-16 20:35:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 3170 states, 3167 states have (on average 4.07136090937796) internal successors, (12894), 3169 states have internal predecessors, (12894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 20:35:00,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:00,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:35:00,167 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:00,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:00,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1107699487, now seen corresponding path program 1 times [2022-11-16 20:35:00,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:00,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361147439] [2022-11-16 20:35:00,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:00,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:00,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:00,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361147439] [2022-11-16 20:35:00,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361147439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:00,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:00,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 20:35:00,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801068317] [2022-11-16 20:35:00,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:00,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:35:00,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:00,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:35:00,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:35:00,756 INFO L87 Difference]: Start difference. First operand has 3170 states, 3167 states have (on average 4.07136090937796) internal successors, (12894), 3169 states have internal predecessors, (12894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:00,927 INFO L93 Difference]: Finished difference Result 2690 states and 10350 transitions. [2022-11-16 20:35:00,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:35:00,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 20:35:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:00,980 INFO L225 Difference]: With dead ends: 2690 [2022-11-16 20:35:00,980 INFO L226 Difference]: Without dead ends: 2610 [2022-11-16 20:35:00,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-11-16 20:35:00,984 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:00,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:35:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2022-11-16 20:35:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2022-11-16 20:35:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2609 states have (on average 3.865848984285167) internal successors, (10086), 2609 states have internal predecessors, (10086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:01,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10086 transitions. [2022-11-16 20:35:01,170 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10086 transitions. Word has length 9 [2022-11-16 20:35:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:01,171 INFO L495 AbstractCegarLoop]: Abstraction has 2610 states and 10086 transitions. [2022-11-16 20:35:01,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10086 transitions. [2022-11-16 20:35:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 20:35:01,174 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:01,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:35:01,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 20:35:01,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:01,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:01,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1239763222, now seen corresponding path program 1 times [2022-11-16 20:35:01,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:01,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598089222] [2022-11-16 20:35:01,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:01,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:01,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598089222] [2022-11-16 20:35:01,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598089222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:01,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:01,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:35:01,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976900259] [2022-11-16 20:35:01,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:01,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:35:01,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:01,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:35:01,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:35:01,542 INFO L87 Difference]: Start difference. First operand 2610 states and 10086 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:01,855 INFO L93 Difference]: Finished difference Result 4538 states and 16618 transitions. [2022-11-16 20:35:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:35:01,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 20:35:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:01,890 INFO L225 Difference]: With dead ends: 4538 [2022-11-16 20:35:01,890 INFO L226 Difference]: Without dead ends: 3754 [2022-11-16 20:35:01,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:35:01,893 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:01,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 18 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:35:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2022-11-16 20:35:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3290. [2022-11-16 20:35:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3290 states, 3289 states have (on average 3.7707509881422925) internal successors, (12402), 3289 states have internal predecessors, (12402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3290 states to 3290 states and 12402 transitions. [2022-11-16 20:35:02,135 INFO L78 Accepts]: Start accepts. Automaton has 3290 states and 12402 transitions. Word has length 12 [2022-11-16 20:35:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:02,136 INFO L495 AbstractCegarLoop]: Abstraction has 3290 states and 12402 transitions. [2022-11-16 20:35:02,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3290 states and 12402 transitions. [2022-11-16 20:35:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 20:35:02,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:02,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:35:02,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 20:35:02,146 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:02,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1491665238, now seen corresponding path program 1 times [2022-11-16 20:35:02,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:02,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536295343] [2022-11-16 20:35:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:02,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:02,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536295343] [2022-11-16 20:35:02,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536295343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:02,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:02,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:35:02,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182106738] [2022-11-16 20:35:02,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:02,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:35:02,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:02,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:35:02,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:35:02,479 INFO L87 Difference]: Start difference. First operand 3290 states and 12402 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:02,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:02,758 INFO L93 Difference]: Finished difference Result 3898 states and 14106 transitions. [2022-11-16 20:35:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 20:35:02,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 20:35:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:02,789 INFO L225 Difference]: With dead ends: 3898 [2022-11-16 20:35:02,789 INFO L226 Difference]: Without dead ends: 3322 [2022-11-16 20:35:02,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:35:02,791 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:02,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 17 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:35:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2022-11-16 20:35:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 2698. [2022-11-16 20:35:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2698 states, 2697 states have (on average 3.757508342602892) internal successors, (10134), 2697 states have internal predecessors, (10134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 10134 transitions. [2022-11-16 20:35:02,902 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 10134 transitions. Word has length 13 [2022-11-16 20:35:02,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:02,902 INFO L495 AbstractCegarLoop]: Abstraction has 2698 states and 10134 transitions. [2022-11-16 20:35:02,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 10134 transitions. [2022-11-16 20:35:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 20:35:02,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:02,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:35:02,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 20:35:02,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:02,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:02,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1177245259, now seen corresponding path program 1 times [2022-11-16 20:35:02,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:02,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433966356] [2022-11-16 20:35:02,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:02,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:03,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:03,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433966356] [2022-11-16 20:35:03,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433966356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:03,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:03,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:35:03,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806087856] [2022-11-16 20:35:03,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:03,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:35:03,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:03,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:35:03,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:35:03,171 INFO L87 Difference]: Start difference. First operand 2698 states and 10134 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:03,455 INFO L93 Difference]: Finished difference Result 3670 states and 13164 transitions. [2022-11-16 20:35:03,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 20:35:03,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 20:35:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:03,498 INFO L225 Difference]: With dead ends: 3670 [2022-11-16 20:35:03,498 INFO L226 Difference]: Without dead ends: 3194 [2022-11-16 20:35:03,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:35:03,500 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 65 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:03,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 15 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:35:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-11-16 20:35:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2634. [2022-11-16 20:35:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2633 states have (on average 3.7394606912267374) internal successors, (9846), 2633 states have internal predecessors, (9846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 9846 transitions. [2022-11-16 20:35:03,604 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 9846 transitions. Word has length 14 [2022-11-16 20:35:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:03,605 INFO L495 AbstractCegarLoop]: Abstraction has 2634 states and 9846 transitions. [2022-11-16 20:35:03,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 9846 transitions. [2022-11-16 20:35:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 20:35:03,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:03,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:35:03,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 20:35:03,610 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:03,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:03,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1854977463, now seen corresponding path program 1 times [2022-11-16 20:35:03,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:03,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340489774] [2022-11-16 20:35:03,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:03,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:03,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340489774] [2022-11-16 20:35:03,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340489774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:03,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:03,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:35:03,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645035801] [2022-11-16 20:35:03,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:03,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:35:03,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:03,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:35:03,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:35:03,927 INFO L87 Difference]: Start difference. First operand 2634 states and 9846 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:04,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:04,067 INFO L93 Difference]: Finished difference Result 2730 states and 10006 transitions. [2022-11-16 20:35:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:35:04,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 20:35:04,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:04,080 INFO L225 Difference]: With dead ends: 2730 [2022-11-16 20:35:04,081 INFO L226 Difference]: Without dead ends: 2442 [2022-11-16 20:35:04,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:35:04,082 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:04,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 18 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:35:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2022-11-16 20:35:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2250. [2022-11-16 20:35:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2249 states have (on average 3.7092040907069808) internal successors, (8342), 2249 states have internal predecessors, (8342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:04,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 8342 transitions. [2022-11-16 20:35:04,157 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 8342 transitions. Word has length 15 [2022-11-16 20:35:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:04,158 INFO L495 AbstractCegarLoop]: Abstraction has 2250 states and 8342 transitions. [2022-11-16 20:35:04,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 8342 transitions. [2022-11-16 20:35:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 20:35:04,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:04,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:35:04,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 20:35:04,163 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:04,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash -181875459, now seen corresponding path program 1 times [2022-11-16 20:35:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:04,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789858995] [2022-11-16 20:35:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:04,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:04,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789858995] [2022-11-16 20:35:04,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789858995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:04,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:04,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:35:04,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652244555] [2022-11-16 20:35:04,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:04,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:35:04,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:04,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:35:04,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:35:04,392 INFO L87 Difference]: Start difference. First operand 2250 states and 8342 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:04,469 INFO L93 Difference]: Finished difference Result 1750 states and 5846 transitions. [2022-11-16 20:35:04,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:35:04,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 20:35:04,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:04,478 INFO L225 Difference]: With dead ends: 1750 [2022-11-16 20:35:04,479 INFO L226 Difference]: Without dead ends: 1750 [2022-11-16 20:35:04,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-16 20:35:04,480 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:04,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:35:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2022-11-16 20:35:04,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1750. [2022-11-16 20:35:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1749 states have (on average 3.342481417953116) internal successors, (5846), 1749 states have internal predecessors, (5846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 5846 transitions. [2022-11-16 20:35:04,541 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 5846 transitions. Word has length 16 [2022-11-16 20:35:04,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:04,542 INFO L495 AbstractCegarLoop]: Abstraction has 1750 states and 5846 transitions. [2022-11-16 20:35:04,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:04,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 5846 transitions. [2022-11-16 20:35:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 20:35:04,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:04,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:35:04,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 20:35:04,546 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:04,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:04,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1378943076, now seen corresponding path program 1 times [2022-11-16 20:35:04,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:04,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963983109] [2022-11-16 20:35:04,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:04,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:04,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:04,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963983109] [2022-11-16 20:35:04,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963983109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:04,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:04,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:35:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082298724] [2022-11-16 20:35:04,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:04,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:35:04,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:04,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:35:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:35:04,777 INFO L87 Difference]: Start difference. First operand 1750 states and 5846 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:04,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:04,874 INFO L93 Difference]: Finished difference Result 1122 states and 3344 transitions. [2022-11-16 20:35:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:35:04,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 20:35:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:04,878 INFO L225 Difference]: With dead ends: 1122 [2022-11-16 20:35:04,878 INFO L226 Difference]: Without dead ends: 1122 [2022-11-16 20:35:04,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:35:04,879 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:04,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 12 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:35:04,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2022-11-16 20:35:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1118. [2022-11-16 20:35:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1117 states have (on average 2.9811996418979407) internal successors, (3330), 1117 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 3330 transitions. [2022-11-16 20:35:04,910 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 3330 transitions. Word has length 18 [2022-11-16 20:35:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:04,911 INFO L495 AbstractCegarLoop]: Abstraction has 1118 states and 3330 transitions. [2022-11-16 20:35:04,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 3330 transitions. [2022-11-16 20:35:04,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 20:35:04,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:04,914 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] [2022-11-16 20:35:04,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 20:35:04,914 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:04,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:04,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1307562039, now seen corresponding path program 1 times [2022-11-16 20:35:04,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:04,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365013617] [2022-11-16 20:35:04,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:04,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:05,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:05,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365013617] [2022-11-16 20:35:05,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365013617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:05,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:05,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:35:05,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567527592] [2022-11-16 20:35:05,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:05,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:35:05,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:05,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:35:05,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:35:05,131 INFO L87 Difference]: Start difference. First operand 1118 states and 3330 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:05,248 INFO L93 Difference]: Finished difference Result 822 states and 2450 transitions. [2022-11-16 20:35:05,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:35:05,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 20:35:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:05,251 INFO L225 Difference]: With dead ends: 822 [2022-11-16 20:35:05,251 INFO L226 Difference]: Without dead ends: 822 [2022-11-16 20:35:05,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:35:05,252 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 75 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:05,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 16 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:35:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-11-16 20:35:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 798. [2022-11-16 20:35:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 2.9811794228356336) internal successors, (2376), 797 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2376 transitions. [2022-11-16 20:35:05,277 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2376 transitions. Word has length 21 [2022-11-16 20:35:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:05,278 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 2376 transitions. [2022-11-16 20:35:05,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2376 transitions. [2022-11-16 20:35:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 20:35:05,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:05,280 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] [2022-11-16 20:35:05,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 20:35:05,280 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:05,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:05,281 INFO L85 PathProgramCache]: Analyzing trace with hash 53950931, now seen corresponding path program 1 times [2022-11-16 20:35:05,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:05,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614824006] [2022-11-16 20:35:05,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:05,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:05,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:05,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614824006] [2022-11-16 20:35:05,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614824006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:05,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:05,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 20:35:05,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937672205] [2022-11-16 20:35:05,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:05,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 20:35:05,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:05,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 20:35:05,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:35:05,620 INFO L87 Difference]: Start difference. First operand 798 states and 2376 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:05,746 INFO L93 Difference]: Finished difference Result 738 states and 2258 transitions. [2022-11-16 20:35:05,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:35:05,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 20:35:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:05,749 INFO L225 Difference]: With dead ends: 738 [2022-11-16 20:35:05,750 INFO L226 Difference]: Without dead ends: 714 [2022-11-16 20:35:05,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:35:05,750 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 96 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:05,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 15 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:35:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-11-16 20:35:05,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 670. [2022-11-16 20:35:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 3.0762331838565022) internal successors, (2058), 669 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 2058 transitions. [2022-11-16 20:35:05,773 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 2058 transitions. Word has length 24 [2022-11-16 20:35:05,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:05,774 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 2058 transitions. [2022-11-16 20:35:05,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 2058 transitions. [2022-11-16 20:35:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 20:35:05,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:05,778 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] [2022-11-16 20:35:05,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 20:35:05,779 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:05,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:05,779 INFO L85 PathProgramCache]: Analyzing trace with hash 970240491, now seen corresponding path program 1 times [2022-11-16 20:35:05,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:05,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817926989] [2022-11-16 20:35:05,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:05,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:06,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:06,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:06,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817926989] [2022-11-16 20:35:06,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817926989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:06,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:06,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:35:06,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454410020] [2022-11-16 20:35:06,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:06,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:35:06,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:06,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:35:06,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:35:06,096 INFO L87 Difference]: Start difference. First operand 670 states and 2058 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:06,245 INFO L93 Difference]: Finished difference Result 841 states and 2536 transitions. [2022-11-16 20:35:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:35:06,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-16 20:35:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:06,247 INFO L225 Difference]: With dead ends: 841 [2022-11-16 20:35:06,247 INFO L226 Difference]: Without dead ends: 314 [2022-11-16 20:35:06,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:35:06,248 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:06,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 25 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:35:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-16 20:35:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2022-11-16 20:35:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.6996805111821085) internal successors, (845), 313 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 845 transitions. [2022-11-16 20:35:06,257 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 845 transitions. Word has length 27 [2022-11-16 20:35:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:06,258 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 845 transitions. [2022-11-16 20:35:06,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 845 transitions. [2022-11-16 20:35:06,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 20:35:06,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:06,259 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] [2022-11-16 20:35:06,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 20:35:06,259 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:06,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1516624595, now seen corresponding path program 2 times [2022-11-16 20:35:06,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:06,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771153169] [2022-11-16 20:35:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:06,559 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:06,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771153169] [2022-11-16 20:35:06,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771153169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:06,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:06,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:35:06,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094313226] [2022-11-16 20:35:06,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:06,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:35:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:35:06,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:35:06,561 INFO L87 Difference]: Start difference. First operand 314 states and 845 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:06,686 INFO L93 Difference]: Finished difference Result 413 states and 1104 transitions. [2022-11-16 20:35:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:35:06,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-16 20:35:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:06,687 INFO L225 Difference]: With dead ends: 413 [2022-11-16 20:35:06,687 INFO L226 Difference]: Without dead ends: 174 [2022-11-16 20:35:06,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:35:06,688 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:06,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 12 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:35:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-16 20:35:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-11-16 20:35:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.479768786127168) internal successors, (429), 173 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 429 transitions. [2022-11-16 20:35:06,693 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 429 transitions. Word has length 27 [2022-11-16 20:35:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:06,694 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 429 transitions. [2022-11-16 20:35:06,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 429 transitions. [2022-11-16 20:35:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 20:35:06,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:06,697 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] [2022-11-16 20:35:06,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 20:35:06,698 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:06,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:06,698 INFO L85 PathProgramCache]: Analyzing trace with hash -530182331, now seen corresponding path program 3 times [2022-11-16 20:35:06,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:06,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088990211] [2022-11-16 20:35:06,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:06,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:07,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:07,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088990211] [2022-11-16 20:35:07,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088990211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:07,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:07,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:35:07,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757970146] [2022-11-16 20:35:07,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:07,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:35:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:07,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:35:07,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:35:07,017 INFO L87 Difference]: Start difference. First operand 174 states and 429 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:07,196 INFO L93 Difference]: Finished difference Result 225 states and 548 transitions. [2022-11-16 20:35:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:35:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-16 20:35:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:07,197 INFO L225 Difference]: With dead ends: 225 [2022-11-16 20:35:07,197 INFO L226 Difference]: Without dead ends: 128 [2022-11-16 20:35:07,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:35:07,198 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:07,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 17 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:35:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-16 20:35:07,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2022-11-16 20:35:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.2869565217391306) internal successors, (263), 115 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 263 transitions. [2022-11-16 20:35:07,202 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 263 transitions. Word has length 27 [2022-11-16 20:35:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:07,202 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 263 transitions. [2022-11-16 20:35:07,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:07,202 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 263 transitions. [2022-11-16 20:35:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 20:35:07,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:07,203 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] [2022-11-16 20:35:07,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 20:35:07,203 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:07,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:07,204 INFO L85 PathProgramCache]: Analyzing trace with hash 461260101, now seen corresponding path program 4 times [2022-11-16 20:35:07,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:07,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119971459] [2022-11-16 20:35:07,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:07,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:07,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119971459] [2022-11-16 20:35:07,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119971459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:07,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:07,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 20:35:07,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14232637] [2022-11-16 20:35:07,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:07,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 20:35:07,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:07,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 20:35:07,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:35:07,495 INFO L87 Difference]: Start difference. First operand 116 states and 263 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:07,683 INFO L93 Difference]: Finished difference Result 155 states and 350 transitions. [2022-11-16 20:35:07,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 20:35:07,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-16 20:35:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:07,684 INFO L225 Difference]: With dead ends: 155 [2022-11-16 20:35:07,684 INFO L226 Difference]: Without dead ends: 87 [2022-11-16 20:35:07,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 20:35:07,685 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 37 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:07,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 23 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:35:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-16 20:35:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-16 20:35:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.0930232558139537) internal successors, (180), 86 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 180 transitions. [2022-11-16 20:35:07,688 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 180 transitions. Word has length 27 [2022-11-16 20:35:07,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:07,689 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 180 transitions. [2022-11-16 20:35:07,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 180 transitions. [2022-11-16 20:35:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 20:35:07,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:07,689 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] [2022-11-16 20:35:07,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 20:35:07,690 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:07,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:07,690 INFO L85 PathProgramCache]: Analyzing trace with hash -578615875, now seen corresponding path program 5 times [2022-11-16 20:35:07,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:07,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025852497] [2022-11-16 20:35:07,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:07,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:35:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:35:09,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:35:09,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025852497] [2022-11-16 20:35:09,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025852497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:35:09,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:35:09,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 20:35:09,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111593037] [2022-11-16 20:35:09,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:35:09,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 20:35:09,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:35:09,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 20:35:09,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 20:35:09,085 INFO L87 Difference]: Start difference. First operand 87 states and 180 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:09,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:35:09,274 INFO L93 Difference]: Finished difference Result 106 states and 215 transitions. [2022-11-16 20:35:09,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 20:35:09,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-16 20:35:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:35:09,275 INFO L225 Difference]: With dead ends: 106 [2022-11-16 20:35:09,275 INFO L226 Difference]: Without dead ends: 55 [2022-11-16 20:35:09,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-16 20:35:09,276 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:35:09,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 42 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:35:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-16 20:35:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-16 20:35:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.7407407407407407) internal successors, (94), 54 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:09,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 94 transitions. [2022-11-16 20:35:09,278 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 94 transitions. Word has length 27 [2022-11-16 20:35:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:35:09,278 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 94 transitions. [2022-11-16 20:35:09,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:35:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2022-11-16 20:35:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 20:35:09,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:35:09,279 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] [2022-11-16 20:35:09,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 20:35:09,279 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:35:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:35:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1142543443, now seen corresponding path program 6 times [2022-11-16 20:35:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:35:09,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602224623] [2022-11-16 20:35:09,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:35:09,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:35:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:35:09,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 20:35:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:35:09,437 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 20:35:09,437 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 20:35:09,438 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-16 20:35:09,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-16 20:35:09,440 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-16 20:35:09,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-16 20:35:09,443 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-16 20:35:09,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-16 20:35:09,444 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-16 20:35:09,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 20:35:09,448 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:35:09,453 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 20:35:09,454 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 20:35:09,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:35:09 BasicIcfg [2022-11-16 20:35:09,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 20:35:09,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 20:35:09,590 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 20:35:09,591 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 20:35:09,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:34:54" (3/4) ... [2022-11-16 20:35:09,593 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 20:35:09,693 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/witness.graphml [2022-11-16 20:35:09,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 20:35:09,694 INFO L158 Benchmark]: Toolchain (without parser) took 17222.21ms. Allocated memory was 140.5MB in the beginning and 369.1MB in the end (delta: 228.6MB). Free memory was 99.7MB in the beginning and 290.5MB in the end (delta: -190.8MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2022-11-16 20:35:09,694 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 140.5MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:35:09,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 725.95ms. Allocated memory is still 140.5MB. Free memory was 99.5MB in the beginning and 98.9MB in the end (delta: 569.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 20:35:09,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.41ms. Allocated memory is still 140.5MB. Free memory was 98.9MB in the beginning and 96.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 20:35:09,695 INFO L158 Benchmark]: Boogie Preprocessor took 68.92ms. Allocated memory is still 140.5MB. Free memory was 96.2MB in the beginning and 94.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:35:09,695 INFO L158 Benchmark]: RCFGBuilder took 870.05ms. Allocated memory is still 140.5MB. Free memory was 94.1MB in the beginning and 57.2MB in the end (delta: 36.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-16 20:35:09,696 INFO L158 Benchmark]: TraceAbstraction took 15347.52ms. Allocated memory was 140.5MB in the beginning and 369.1MB in the end (delta: 228.6MB). Free memory was 113.1MB in the beginning and 307.3MB in the end (delta: -194.1MB). Peak memory consumption was 245.6MB. Max. memory is 16.1GB. [2022-11-16 20:35:09,696 INFO L158 Benchmark]: Witness Printer took 103.15ms. Allocated memory is still 369.1MB. Free memory was 307.3MB in the beginning and 290.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-16 20:35:09,698 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.27ms. Allocated memory is still 140.5MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 725.95ms. Allocated memory is still 140.5MB. Free memory was 99.5MB in the beginning and 98.9MB in the end (delta: 569.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.41ms. Allocated memory is still 140.5MB. Free memory was 98.9MB in the beginning and 96.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.92ms. Allocated memory is still 140.5MB. Free memory was 96.2MB in the beginning and 94.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 870.05ms. Allocated memory is still 140.5MB. Free memory was 94.1MB in the beginning and 57.2MB in the end (delta: 36.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15347.52ms. Allocated memory was 140.5MB in the beginning and 369.1MB in the end (delta: 228.6MB). Free memory was 113.1MB in the beginning and 307.3MB in the end (delta: -194.1MB). Peak memory consumption was 245.6MB. Max. memory is 16.1GB. * Witness Printer took 103.15ms. Allocated memory is still 369.1MB. Free memory was 307.3MB in the beginning and 290.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 148 PlacesBefore, 46 PlacesAfterwards, 137 TransitionsBefore, 34 TransitionsAfterwards, 3074 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 8139 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4357, independent: 4153, independent conditional: 0, independent unconditional: 4153, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2174, independent: 2120, independent conditional: 0, independent unconditional: 2120, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2174, independent: 2089, independent conditional: 0, independent unconditional: 2089, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 85, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 345, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4357, independent: 2033, independent conditional: 0, independent unconditional: 2033, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 2174, unknown conditional: 0, unknown unconditional: 2174] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 272, Positive conditional cache size: 0, Positive unconditional cache size: 272, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L742] 0 _Bool z$r_buff1_thd4; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool weak$$choice0; [L747] 0 int z$w_buff1; [L750] 0 _Bool weak$$choice2; [L731] 0 _Bool z$flush_delayed; [L745] 0 int z$w_buff0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L712] 0 int __unbuffered_p1_EAX = 0; [L733] 0 _Bool z$r_buff0_thd0; [L720] 0 int __unbuffered_p3_EBX = 0; [L736] 0 _Bool z$r_buff0_thd3; [L732] 0 int z$mem_tmp; [L737] 0 _Bool z$r_buff0_thd4; [L743] 0 _Bool z$read_delayed; [L722] 0 int a = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L744] 0 int *z$read_delayed_var; [L748] 0 _Bool z$w_buff1_used; [L710] 0 int __unbuffered_cnt = 0; [L724] 0 _Bool main$tmp_guard1; [L723] 0 _Bool main$tmp_guard0; [L714] 0 int __unbuffered_p1_EBX = 0; [L746] 0 _Bool z$w_buff0_used; [L718] 0 int __unbuffered_p3_EAX = 0; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L869] 0 pthread_t t357; [L870] FCALL, FORK 0 pthread_create(&t357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t357, ((void *)0), P0, ((void *)0))=-3, t357={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t358; [L872] FCALL, FORK 0 pthread_create(&t358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t358, ((void *)0), P1, ((void *)0))=-2, t357={5:0}, t358={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t359; [L874] FCALL, FORK 0 pthread_create(&t359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t359, ((void *)0), P2, ((void *)0))=-1, t357={5:0}, t358={6:0}, t359={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t360; [L876] FCALL, FORK 0 pthread_create(&t360, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t360, ((void *)0), P3, ((void *)0))=0, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L787] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t357={5:0}, t358={6:0}, t359={7:0}, t360={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 541 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 541 mSDsluCounter, 246 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1491 IncrementalHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 95 mSDtfsCounter, 1491 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3290occurred in iteration=2, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 1924 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 1860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 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-11-16 20:35:09,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2e071e3-eaf6-4d0c-b868-804706c4dd60/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE