./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8 --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 5122a8d22cb1f4fb0c3acef9abe3b4cd7e56d6bb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:15:40,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:15:40,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:15:40,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:15:40,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:15:40,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:15:40,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:15:40,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:15:40,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:15:40,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:15:40,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:15:40,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:15:40,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:15:40,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:15:40,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:15:40,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:15:40,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:15:40,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:15:40,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:15:40,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:15:40,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:15:40,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:15:40,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:15:40,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:15:40,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:15:40,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:15:40,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:15:40,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:15:40,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:15:40,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:15:40,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:15:40,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:15:40,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:15:40,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:15:40,179 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:15:40,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:15:40,180 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:15:40,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:15:40,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:15:40,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:15:40,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:15:40,184 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:15:40,215 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:15:40,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:15:40,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:15:40,217 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:15:40,217 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:15:40,217 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:15:40,218 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:15:40,218 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:15:40,218 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:15:40,218 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:15:40,219 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:15:40,219 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:15:40,219 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:15:40,220 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:15:40,220 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:15:40,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:15:40,221 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:15:40,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:15:40,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:15:40,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:15:40,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:15:40,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:15:40,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:15:40,223 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:15:40,223 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:15:40,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:15:40,224 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:15:40,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:15:40,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:15:40,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:15:40,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:15:40,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:15:40,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:15:40,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:15:40,226 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:15:40,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:15:40,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:15:40,227 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:15:40,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:15:40,228 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/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_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8 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 -> 5122a8d22cb1f4fb0c3acef9abe3b4cd7e56d6bb [2021-10-13 07:15:40,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:15:40,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:15:40,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:15:40,591 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:15:40,592 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:15:40,593 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/pthread-wmm/mix055_pso.opt.i [2021-10-13 07:15:40,672 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/data/217ebc667/3eb42567fb3b4fdbb02adb0ac6dc8181/FLAG5ce173294 [2021-10-13 07:15:41,330 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:15:41,330 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/sv-benchmarks/c/pthread-wmm/mix055_pso.opt.i [2021-10-13 07:15:41,353 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/data/217ebc667/3eb42567fb3b4fdbb02adb0ac6dc8181/FLAG5ce173294 [2021-10-13 07:15:41,614 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/data/217ebc667/3eb42567fb3b4fdbb02adb0ac6dc8181 [2021-10-13 07:15:41,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:15:41,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:15:41,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:15:41,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:15:41,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:15:41,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:15:41" (1/1) ... [2021-10-13 07:15:41,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2fba50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:41, skipping insertion in model container [2021-10-13 07:15:41,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:15:41" (1/1) ... [2021-10-13 07:15:41,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:15:41,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:15:41,934 WARN L228 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_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/sv-benchmarks/c/pthread-wmm/mix055_pso.opt.i[948,961] [2021-10-13 07:15:42,304 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:15:42,319 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:15:42,336 WARN L228 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_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/sv-benchmarks/c/pthread-wmm/mix055_pso.opt.i[948,961] [2021-10-13 07:15:42,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:15:42,476 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:15:42,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:42 WrapperNode [2021-10-13 07:15:42,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:15:42,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:15:42,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:15:42,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:15:42,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:42" (1/1) ... [2021-10-13 07:15:42,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:42" (1/1) ... [2021-10-13 07:15:42,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:15:42,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:15:42,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:15:42,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:15:42,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:42" (1/1) ... [2021-10-13 07:15:42,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:42" (1/1) ... [2021-10-13 07:15:42,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:42" (1/1) ... [2021-10-13 07:15:42,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:42" (1/1) ... [2021-10-13 07:15:42,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:42" (1/1) ... [2021-10-13 07:15:42,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:42" (1/1) ... [2021-10-13 07:15:42,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:42" (1/1) ... [2021-10-13 07:15:42,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:15:42,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:15:42,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:15:42,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:15:42,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:42" (1/1) ... [2021-10-13 07:15:42,678 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:15:42,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:15:42,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:15:42,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:15:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 07:15:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-13 07:15:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:15:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 07:15:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-13 07:15:42,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-13 07:15:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-13 07:15:42,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-13 07:15:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-13 07:15:42,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-13 07:15:42,765 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-10-13 07:15:42,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-10-13 07:15:42,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:15:42,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-13 07:15:42,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:15:42,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:15:42,768 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-13 07:15:45,120 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:15:45,121 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-13 07:15:45,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:15:45 BoogieIcfgContainer [2021-10-13 07:15:45,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:15:45,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:15:45,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:15:45,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:15:45,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:15:41" (1/3) ... [2021-10-13 07:15:45,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:15:45, skipping insertion in model container [2021-10-13 07:15:45,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:15:42" (2/3) ... [2021-10-13 07:15:45,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:15:45, skipping insertion in model container [2021-10-13 07:15:45,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:15:45" (3/3) ... [2021-10-13 07:15:45,140 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_pso.opt.i [2021-10-13 07:15:45,147 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-13 07:15:45,147 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:15:45,148 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 07:15:45,148 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-13 07:15:45,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,207 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,209 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,210 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,212 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,245 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,245 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,246 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,246 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,248 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,248 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,249 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,249 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,249 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,250 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,262 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,263 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,263 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,263 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,264 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,264 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,264 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,265 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,265 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,265 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,266 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,266 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,267 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,270 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,278 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,278 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,281 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,281 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,284 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,284 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,284 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,285 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,291 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,291 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 07:15:45,295 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-13 07:15:45,351 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:15:45,359 INFO L339 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, mConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:15:45,360 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-10-13 07:15:45,379 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-13 07:15:45,392 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 270 flow [2021-10-13 07:15:45,396 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 270 flow [2021-10-13 07:15:45,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 270 flow [2021-10-13 07:15:45,464 INFO L129 PetriNetUnfolder]: 2/121 cut-off events. [2021-10-13 07:15:45,465 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-13 07:15:45,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2021-10-13 07:15:45,476 INFO L116 LiptonReduction]: Number of co-enabled transitions 2682 [2021-10-13 07:16:00,247 INFO L131 LiptonReduction]: Checked pairs total: 6536 [2021-10-13 07:16:00,247 INFO L133 LiptonReduction]: Total number of compositions: 103 [2021-10-13 07:16:00,258 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2021-10-13 07:16:00,493 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2762 states, 2759 states have (on average 4.042044218919899) internal successors, (11152), 2761 states have internal predecessors, (11152), 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) [2021-10-13 07:16:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 2762 states, 2759 states have (on average 4.042044218919899) internal successors, (11152), 2761 states have internal predecessors, (11152), 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) [2021-10-13 07:16:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 07:16:00,525 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:00,526 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:00,527 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:00,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:00,534 INFO L82 PathProgramCache]: Analyzing trace with hash 718366423, now seen corresponding path program 1 times [2021-10-13 07:16:00,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:00,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117534008] [2021-10-13 07:16:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:00,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:01,080 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:01,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117534008] [2021-10-13 07:16:01,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117534008] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:01,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:01,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 07:16:01,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613463650] [2021-10-13 07:16:01,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:16:01,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:16:01,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:16:01,131 INFO L87 Difference]: Start difference. First operand has 2762 states, 2759 states have (on average 4.042044218919899) internal successors, (11152), 2761 states have internal predecessors, (11152), 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) [2021-10-13 07:16:01,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:01,294 INFO L93 Difference]: Finished difference Result 2282 states and 8688 transitions. [2021-10-13 07:16:01,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:16:01,296 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 [2021-10-13 07:16:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:01,363 INFO L225 Difference]: With dead ends: 2282 [2021-10-13 07:16:01,367 INFO L226 Difference]: Without dead ends: 2202 [2021-10-13 07:16:01,369 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:16:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2021-10-13 07:16:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2021-10-13 07:16:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 2201 states have (on average 3.8273512039981825) internal successors, (8424), 2201 states have internal predecessors, (8424), 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) [2021-10-13 07:16:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions. [2021-10-13 07:16:01,636 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9 [2021-10-13 07:16:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:01,638 INFO L470 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions. [2021-10-13 07:16:01,639 INFO L471 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) [2021-10-13 07:16:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions. [2021-10-13 07:16:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 07:16:01,653 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:01,653 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:01,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:16:01,654 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:01,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:01,655 INFO L82 PathProgramCache]: Analyzing trace with hash -966357418, now seen corresponding path program 1 times [2021-10-13 07:16:01,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:01,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747183554] [2021-10-13 07:16:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:01,656 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:02,019 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:02,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747183554] [2021-10-13 07:16:02,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747183554] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:02,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:02,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:16:02,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522915639] [2021-10-13 07:16:02,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:16:02,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:02,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:16:02,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:16:02,030 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2021-10-13 07:16:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:02,172 INFO L93 Difference]: Finished difference Result 2538 states and 9408 transitions. [2021-10-13 07:16:02,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:16:02,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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 [2021-10-13 07:16:02,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:02,313 INFO L225 Difference]: With dead ends: 2538 [2021-10-13 07:16:02,314 INFO L226 Difference]: Without dead ends: 2138 [2021-10-13 07:16:02,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.3ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:16:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2021-10-13 07:16:02,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2138. [2021-10-13 07:16:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 2137 states have (on average 3.807206364061769) internal successors, (8136), 2137 states have internal predecessors, (8136), 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) [2021-10-13 07:16:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 8136 transitions. [2021-10-13 07:16:02,495 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 8136 transitions. Word has length 12 [2021-10-13 07:16:02,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:02,497 INFO L470 AbstractCegarLoop]: Abstraction has 2138 states and 8136 transitions. [2021-10-13 07:16:02,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2021-10-13 07:16:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 8136 transitions. [2021-10-13 07:16:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 07:16:02,502 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:02,502 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:02,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:16:02,511 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:02,513 INFO L82 PathProgramCache]: Analyzing trace with hash 90323613, now seen corresponding path program 1 times [2021-10-13 07:16:02,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:02,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370718959] [2021-10-13 07:16:02,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:02,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:02,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:02,797 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:02,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370718959] [2021-10-13 07:16:02,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370718959] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:02,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:02,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:16:02,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704101583] [2021-10-13 07:16:02,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:16:02,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:02,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:16:02,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:16:02,800 INFO L87 Difference]: Start difference. First operand 2138 states and 8136 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2021-10-13 07:16:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:03,012 INFO L93 Difference]: Finished difference Result 2538 states and 9464 transitions. [2021-10-13 07:16:03,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 07:16:03,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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 [2021-10-13 07:16:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:03,044 INFO L225 Difference]: With dead ends: 2538 [2021-10-13 07:16:03,045 INFO L226 Difference]: Without dead ends: 2202 [2021-10-13 07:16:03,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 54.0ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:16:03,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2021-10-13 07:16:03,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2162. [2021-10-13 07:16:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2162 states, 2161 states have (on average 3.8065710319296624) internal successors, (8226), 2161 states have internal predecessors, (8226), 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) [2021-10-13 07:16:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 8226 transitions. [2021-10-13 07:16:03,241 INFO L78 Accepts]: Start accepts. Automaton has 2162 states and 8226 transitions. Word has length 13 [2021-10-13 07:16:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:03,241 INFO L470 AbstractCegarLoop]: Abstraction has 2162 states and 8226 transitions. [2021-10-13 07:16:03,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2021-10-13 07:16:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 8226 transitions. [2021-10-13 07:16:03,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 07:16:03,244 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:03,245 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:03,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:16:03,245 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:03,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:03,246 INFO L82 PathProgramCache]: Analyzing trace with hash 107679273, now seen corresponding path program 2 times [2021-10-13 07:16:03,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:03,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539265258] [2021-10-13 07:16:03,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:03,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:03,411 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:03,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539265258] [2021-10-13 07:16:03,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539265258] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:03,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:03,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:16:03,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859840987] [2021-10-13 07:16:03,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:16:03,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:03,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:16:03,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:16:03,414 INFO L87 Difference]: Start difference. First operand 2162 states and 8226 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2021-10-13 07:16:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:03,549 INFO L93 Difference]: Finished difference Result 2354 states and 8690 transitions. [2021-10-13 07:16:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:16:03,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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 [2021-10-13 07:16:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:03,578 INFO L225 Difference]: With dead ends: 2354 [2021-10-13 07:16:03,578 INFO L226 Difference]: Without dead ends: 2034 [2021-10-13 07:16:03,579 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 46.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:16:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2021-10-13 07:16:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2026. [2021-10-13 07:16:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 2025 states have (on average 3.7639506172839505) internal successors, (7622), 2025 states have internal predecessors, (7622), 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) [2021-10-13 07:16:03,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 7622 transitions. [2021-10-13 07:16:03,774 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 7622 transitions. Word has length 13 [2021-10-13 07:16:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:03,775 INFO L470 AbstractCegarLoop]: Abstraction has 2026 states and 7622 transitions. [2021-10-13 07:16:03,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2021-10-13 07:16:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 7622 transitions. [2021-10-13 07:16:03,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 07:16:03,779 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:03,779 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:03,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:16:03,780 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1645037206, now seen corresponding path program 1 times [2021-10-13 07:16:03,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:03,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823403117] [2021-10-13 07:16:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:03,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:03,908 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:03,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823403117] [2021-10-13 07:16:03,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823403117] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:03,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:03,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:16:03,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542318158] [2021-10-13 07:16:03,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:16:03,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:03,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:16:03,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:16:03,912 INFO L87 Difference]: Start difference. First operand 2026 states and 7622 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2021-10-13 07:16:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:03,976 INFO L93 Difference]: Finished difference Result 2254 states and 8224 transitions. [2021-10-13 07:16:03,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:16:03,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 [2021-10-13 07:16:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:04,006 INFO L225 Difference]: With dead ends: 2254 [2021-10-13 07:16:04,006 INFO L226 Difference]: Without dead ends: 1950 [2021-10-13 07:16:04,007 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:16:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2021-10-13 07:16:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1950. [2021-10-13 07:16:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1949 states have (on average 3.736275012827091) internal successors, (7282), 1949 states have internal predecessors, (7282), 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) [2021-10-13 07:16:04,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 7282 transitions. [2021-10-13 07:16:04,132 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 7282 transitions. Word has length 14 [2021-10-13 07:16:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:04,133 INFO L470 AbstractCegarLoop]: Abstraction has 1950 states and 7282 transitions. [2021-10-13 07:16:04,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2021-10-13 07:16:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 7282 transitions. [2021-10-13 07:16:04,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 07:16:04,137 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:04,138 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:04,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:16:04,138 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:04,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:04,139 INFO L82 PathProgramCache]: Analyzing trace with hash 342987465, now seen corresponding path program 1 times [2021-10-13 07:16:04,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:04,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097576193] [2021-10-13 07:16:04,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:04,140 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:04,281 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:04,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097576193] [2021-10-13 07:16:04,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097576193] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:04,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:04,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:16:04,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445163881] [2021-10-13 07:16:04,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:16:04,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:04,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:16:04,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:16:04,292 INFO L87 Difference]: Start difference. First operand 1950 states and 7282 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2021-10-13 07:16:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:04,423 INFO L93 Difference]: Finished difference Result 2076 states and 7588 transitions. [2021-10-13 07:16:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:16:04,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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 [2021-10-13 07:16:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:04,450 INFO L225 Difference]: With dead ends: 2076 [2021-10-13 07:16:04,450 INFO L226 Difference]: Without dead ends: 1866 [2021-10-13 07:16:04,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 30.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:16:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2021-10-13 07:16:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1866. [2021-10-13 07:16:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1865 states have (on average 3.720107238605898) internal successors, (6938), 1865 states have internal predecessors, (6938), 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) [2021-10-13 07:16:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 6938 transitions. [2021-10-13 07:16:04,613 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 6938 transitions. Word has length 15 [2021-10-13 07:16:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:04,614 INFO L470 AbstractCegarLoop]: Abstraction has 1866 states and 6938 transitions. [2021-10-13 07:16:04,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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) [2021-10-13 07:16:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 6938 transitions. [2021-10-13 07:16:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 07:16:04,620 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:04,620 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:04,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:16:04,620 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:04,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2025309322, now seen corresponding path program 1 times [2021-10-13 07:16:04,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:04,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855787272] [2021-10-13 07:16:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:04,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:04,763 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:04,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855787272] [2021-10-13 07:16:04,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855787272] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:04,763 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:04,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:16:04,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090987727] [2021-10-13 07:16:04,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:16:04,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:04,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:16:04,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:16:04,766 INFO L87 Difference]: Start difference. First operand 1866 states and 6938 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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) [2021-10-13 07:16:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:04,913 INFO L93 Difference]: Finished difference Result 2330 states and 8612 transitions. [2021-10-13 07:16:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:16:04,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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 [2021-10-13 07:16:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:04,934 INFO L225 Difference]: With dead ends: 2330 [2021-10-13 07:16:04,935 INFO L226 Difference]: Without dead ends: 2162 [2021-10-13 07:16:04,935 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 36.0ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:16:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2021-10-13 07:16:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1978. [2021-10-13 07:16:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1977 states have (on average 3.740010116337886) internal successors, (7394), 1977 states have internal predecessors, (7394), 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) [2021-10-13 07:16:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 7394 transitions. [2021-10-13 07:16:05,036 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 7394 transitions. Word has length 16 [2021-10-13 07:16:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:05,037 INFO L470 AbstractCegarLoop]: Abstraction has 1978 states and 7394 transitions. [2021-10-13 07:16:05,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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) [2021-10-13 07:16:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 7394 transitions. [2021-10-13 07:16:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 07:16:05,042 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:05,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:05,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:16:05,043 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:05,044 INFO L82 PathProgramCache]: Analyzing trace with hash 2042664982, now seen corresponding path program 2 times [2021-10-13 07:16:05,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:05,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139535908] [2021-10-13 07:16:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:05,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:05,289 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:05,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139535908] [2021-10-13 07:16:05,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139535908] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:05,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:05,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:16:05,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025293562] [2021-10-13 07:16:05,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:16:05,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:05,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:16:05,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:16:05,293 INFO L87 Difference]: Start difference. First operand 1978 states and 7394 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2021-10-13 07:16:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:05,433 INFO L93 Difference]: Finished difference Result 2402 states and 8884 transitions. [2021-10-13 07:16:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:16:05,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 [2021-10-13 07:16:05,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:05,450 INFO L225 Difference]: With dead ends: 2402 [2021-10-13 07:16:05,451 INFO L226 Difference]: Without dead ends: 2234 [2021-10-13 07:16:05,451 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 44.6ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:16:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2021-10-13 07:16:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2026. [2021-10-13 07:16:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 2025 states have (on average 3.7185185185185183) internal successors, (7530), 2025 states have internal predecessors, (7530), 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) [2021-10-13 07:16:05,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 7530 transitions. [2021-10-13 07:16:05,553 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 7530 transitions. Word has length 16 [2021-10-13 07:16:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:05,553 INFO L470 AbstractCegarLoop]: Abstraction has 2026 states and 7530 transitions. [2021-10-13 07:16:05,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2021-10-13 07:16:05,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 7530 transitions. [2021-10-13 07:16:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 07:16:05,559 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:05,559 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:05,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:16:05,560 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:05,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:05,560 INFO L82 PathProgramCache]: Analyzing trace with hash -872879306, now seen corresponding path program 3 times [2021-10-13 07:16:05,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:05,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362781291] [2021-10-13 07:16:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:05,561 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:05,685 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:05,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362781291] [2021-10-13 07:16:05,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362781291] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:05,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:05,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:16:05,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386509761] [2021-10-13 07:16:05,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:16:05,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:05,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:16:05,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:16:05,688 INFO L87 Difference]: Start difference. First operand 2026 states and 7530 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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) [2021-10-13 07:16:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:05,801 INFO L93 Difference]: Finished difference Result 2318 states and 8442 transitions. [2021-10-13 07:16:05,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:16:05,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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 [2021-10-13 07:16:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:05,859 INFO L225 Difference]: With dead ends: 2318 [2021-10-13 07:16:05,861 INFO L226 Difference]: Without dead ends: 2122 [2021-10-13 07:16:05,862 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 49.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:16:05,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2021-10-13 07:16:05,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1954. [2021-10-13 07:16:05,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1953 states have (on average 3.6722990271377367) internal successors, (7172), 1953 states have internal predecessors, (7172), 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) [2021-10-13 07:16:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 7172 transitions. [2021-10-13 07:16:05,967 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 7172 transitions. Word has length 16 [2021-10-13 07:16:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:05,968 INFO L470 AbstractCegarLoop]: Abstraction has 1954 states and 7172 transitions. [2021-10-13 07:16:05,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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) [2021-10-13 07:16:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 7172 transitions. [2021-10-13 07:16:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 07:16:05,975 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:05,975 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:05,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:16:05,976 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:05,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1366649035, now seen corresponding path program 1 times [2021-10-13 07:16:05,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:05,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640977215] [2021-10-13 07:16:05,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:05,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:06,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:06,099 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:06,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640977215] [2021-10-13 07:16:06,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640977215] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:06,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:06,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:16:06,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136425646] [2021-10-13 07:16:06,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:16:06,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:06,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:16:06,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:16:06,103 INFO L87 Difference]: Start difference. First operand 1954 states and 7172 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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) [2021-10-13 07:16:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:06,152 INFO L93 Difference]: Finished difference Result 1978 states and 6639 transitions. [2021-10-13 07:16:06,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:16:06,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 [2021-10-13 07:16:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:06,165 INFO L225 Difference]: With dead ends: 1978 [2021-10-13 07:16:06,166 INFO L226 Difference]: Without dead ends: 1546 [2021-10-13 07:16:06,166 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:16:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2021-10-13 07:16:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1546. [2021-10-13 07:16:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1545 states have (on average 3.3333333333333335) internal successors, (5150), 1545 states have internal predecessors, (5150), 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) [2021-10-13 07:16:06,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 5150 transitions. [2021-10-13 07:16:06,239 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 5150 transitions. Word has length 16 [2021-10-13 07:16:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:06,240 INFO L470 AbstractCegarLoop]: Abstraction has 1546 states and 5150 transitions. [2021-10-13 07:16:06,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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) [2021-10-13 07:16:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 5150 transitions. [2021-10-13 07:16:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 07:16:06,245 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:06,245 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:06,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:16:06,246 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:06,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:06,246 INFO L82 PathProgramCache]: Analyzing trace with hash -578755872, now seen corresponding path program 1 times [2021-10-13 07:16:06,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:06,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51898271] [2021-10-13 07:16:06,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:06,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:06,420 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:06,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51898271] [2021-10-13 07:16:06,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51898271] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:06,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:06,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:16:06,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100472728] [2021-10-13 07:16:06,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:16:06,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:06,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:16:06,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:16:06,424 INFO L87 Difference]: Start difference. First operand 1546 states and 5150 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-10-13 07:16:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:06,491 INFO L93 Difference]: Finished difference Result 1259 states and 3823 transitions. [2021-10-13 07:16:06,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:16:06,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2021-10-13 07:16:06,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:06,498 INFO L225 Difference]: With dead ends: 1259 [2021-10-13 07:16:06,498 INFO L226 Difference]: Without dead ends: 980 [2021-10-13 07:16:06,499 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 25.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:16:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2021-10-13 07:16:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2021-10-13 07:16:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 2.9785495403472932) internal successors, (2916), 979 states have internal predecessors, (2916), 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) [2021-10-13 07:16:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2916 transitions. [2021-10-13 07:16:06,548 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2916 transitions. Word has length 17 [2021-10-13 07:16:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:06,548 INFO L470 AbstractCegarLoop]: Abstraction has 980 states and 2916 transitions. [2021-10-13 07:16:06,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-10-13 07:16:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2916 transitions. [2021-10-13 07:16:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 07:16:06,553 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:06,553 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:06,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:16:06,553 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:06,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:06,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1339046613, now seen corresponding path program 1 times [2021-10-13 07:16:06,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:06,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095928490] [2021-10-13 07:16:06,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:06,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:06,661 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:06,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095928490] [2021-10-13 07:16:06,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095928490] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:06,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:06,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:16:06,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858167197] [2021-10-13 07:16:06,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:16:06,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:06,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:16:06,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:16:06,664 INFO L87 Difference]: Start difference. First operand 980 states and 2916 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2021-10-13 07:16:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:06,705 INFO L93 Difference]: Finished difference Result 1440 states and 4111 transitions. [2021-10-13 07:16:06,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:16:06,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2021-10-13 07:16:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:06,711 INFO L225 Difference]: With dead ends: 1440 [2021-10-13 07:16:06,712 INFO L226 Difference]: Without dead ends: 1002 [2021-10-13 07:16:06,712 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:16:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2021-10-13 07:16:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 962. [2021-10-13 07:16:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 2.8314255983350676) internal successors, (2721), 961 states have internal predecessors, (2721), 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) [2021-10-13 07:16:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2721 transitions. [2021-10-13 07:16:06,757 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2721 transitions. Word has length 19 [2021-10-13 07:16:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:06,757 INFO L470 AbstractCegarLoop]: Abstraction has 962 states and 2721 transitions. [2021-10-13 07:16:06,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2021-10-13 07:16:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2721 transitions. [2021-10-13 07:16:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 07:16:06,761 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:06,761 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:06,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 07:16:06,762 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:06,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:06,763 INFO L82 PathProgramCache]: Analyzing trace with hash 702115778, now seen corresponding path program 1 times [2021-10-13 07:16:06,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:06,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278385248] [2021-10-13 07:16:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:06,764 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:06,869 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:06,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278385248] [2021-10-13 07:16:06,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278385248] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:06,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:06,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:16:06,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420196562] [2021-10-13 07:16:06,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:16:06,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:06,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:16:06,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:16:06,872 INFO L87 Difference]: Start difference. First operand 962 states and 2721 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2021-10-13 07:16:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:06,942 INFO L93 Difference]: Finished difference Result 790 states and 2198 transitions. [2021-10-13 07:16:06,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:16:06,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2021-10-13 07:16:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:06,947 INFO L225 Difference]: With dead ends: 790 [2021-10-13 07:16:06,947 INFO L226 Difference]: Without dead ends: 694 [2021-10-13 07:16:06,948 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 32.7ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:16:06,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2021-10-13 07:16:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 682. [2021-10-13 07:16:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 2.8237885462555066) internal successors, (1923), 681 states have internal predecessors, (1923), 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) [2021-10-13 07:16:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1923 transitions. [2021-10-13 07:16:06,976 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1923 transitions. Word has length 19 [2021-10-13 07:16:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:06,977 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 1923 transitions. [2021-10-13 07:16:06,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2021-10-13 07:16:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1923 transitions. [2021-10-13 07:16:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:16:06,980 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:06,981 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:06,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 07:16:06,981 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:06,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:06,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1130859686, now seen corresponding path program 1 times [2021-10-13 07:16:06,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:06,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268054198] [2021-10-13 07:16:06,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:06,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:07,079 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:07,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268054198] [2021-10-13 07:16:07,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268054198] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:07,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:07,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:16:07,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604759763] [2021-10-13 07:16:07,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:16:07,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:07,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:16:07,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:16:07,082 INFO L87 Difference]: Start difference. First operand 682 states and 1923 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-10-13 07:16:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:07,127 INFO L93 Difference]: Finished difference Result 923 states and 2524 transitions. [2021-10-13 07:16:07,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:16:07,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2021-10-13 07:16:07,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:07,130 INFO L225 Difference]: With dead ends: 923 [2021-10-13 07:16:07,131 INFO L226 Difference]: Without dead ends: 619 [2021-10-13 07:16:07,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:16:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-10-13 07:16:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 613. [2021-10-13 07:16:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 2.656862745098039) internal successors, (1626), 612 states have internal predecessors, (1626), 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) [2021-10-13 07:16:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1626 transitions. [2021-10-13 07:16:07,156 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1626 transitions. Word has length 22 [2021-10-13 07:16:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:07,156 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 1626 transitions. [2021-10-13 07:16:07,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-10-13 07:16:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1626 transitions. [2021-10-13 07:16:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:16:07,160 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:07,160 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:16:07,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 07:16:07,161 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:07,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1623612534, now seen corresponding path program 2 times [2021-10-13 07:16:07,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:07,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152934788] [2021-10-13 07:16:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:07,162 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:07,294 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:07,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152934788] [2021-10-13 07:16:07,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152934788] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:07,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:07,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:16:07,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404308435] [2021-10-13 07:16:07,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:16:07,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:07,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:16:07,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:16:07,297 INFO L87 Difference]: Start difference. First operand 613 states and 1626 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-10-13 07:16:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:07,421 INFO L93 Difference]: Finished difference Result 576 states and 1552 transitions. [2021-10-13 07:16:07,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:16:07,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2021-10-13 07:16:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:07,423 INFO L225 Difference]: With dead ends: 576 [2021-10-13 07:16:07,424 INFO L226 Difference]: Without dead ends: 200 [2021-10-13 07:16:07,424 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 69.6ms TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2021-10-13 07:16:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-10-13 07:16:07,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2021-10-13 07:16:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.4916201117318435) internal successors, (446), 179 states have internal predecessors, (446), 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) [2021-10-13 07:16:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 446 transitions. [2021-10-13 07:16:07,432 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 446 transitions. Word has length 22 [2021-10-13 07:16:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:07,433 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 446 transitions. [2021-10-13 07:16:07,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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) [2021-10-13 07:16:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 446 transitions. [2021-10-13 07:16:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:16:07,435 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:07,435 INFO L512 BasicCegarLoop]: 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] [2021-10-13 07:16:07,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 07:16:07,436 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:07,436 INFO L82 PathProgramCache]: Analyzing trace with hash 958777261, now seen corresponding path program 1 times [2021-10-13 07:16:07,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:07,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930314307] [2021-10-13 07:16:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:07,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:07,617 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:07,617 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930314307] [2021-10-13 07:16:07,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930314307] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:07,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:07,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:16:07,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127426023] [2021-10-13 07:16:07,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:16:07,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:07,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:16:07,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:16:07,620 INFO L87 Difference]: Start difference. First operand 180 states and 446 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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) [2021-10-13 07:16:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:07,735 INFO L93 Difference]: Finished difference Result 275 states and 690 transitions. [2021-10-13 07:16:07,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:16:07,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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 26 [2021-10-13 07:16:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:07,736 INFO L225 Difference]: With dead ends: 275 [2021-10-13 07:16:07,737 INFO L226 Difference]: Without dead ends: 92 [2021-10-13 07:16:07,737 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 47.9ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-13 07:16:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-10-13 07:16:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-10-13 07:16:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.1758241758241756) internal successors, (198), 91 states have internal predecessors, (198), 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) [2021-10-13 07:16:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 198 transitions. [2021-10-13 07:16:07,741 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 198 transitions. Word has length 26 [2021-10-13 07:16:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:07,741 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 198 transitions. [2021-10-13 07:16:07,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 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) [2021-10-13 07:16:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 198 transitions. [2021-10-13 07:16:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:16:07,742 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:07,743 INFO L512 BasicCegarLoop]: 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] [2021-10-13 07:16:07,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 07:16:07,743 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:07,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1503814047, now seen corresponding path program 2 times [2021-10-13 07:16:07,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:07,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541388990] [2021-10-13 07:16:07,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:07,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:16:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:16:08,089 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:16:08,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541388990] [2021-10-13 07:16:08,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541388990] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:16:08,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:16:08,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:16:08,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943513015] [2021-10-13 07:16:08,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:16:08,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:16:08,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:16:08,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-13 07:16:08,092 INFO L87 Difference]: Start difference. First operand 92 states and 198 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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) [2021-10-13 07:16:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:16:08,304 INFO L93 Difference]: Finished difference Result 139 states and 289 transitions. [2021-10-13 07:16:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:16:08,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 26 [2021-10-13 07:16:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:16:08,306 INFO L225 Difference]: With dead ends: 139 [2021-10-13 07:16:08,306 INFO L226 Difference]: Without dead ends: 84 [2021-10-13 07:16:08,306 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 149.8ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-10-13 07:16:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-10-13 07:16:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2021-10-13 07:16:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.9365079365079365) internal successors, (122), 63 states have internal predecessors, (122), 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) [2021-10-13 07:16:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2021-10-13 07:16:08,309 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2021-10-13 07:16:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:16:08,310 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2021-10-13 07:16:08,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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) [2021-10-13 07:16:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2021-10-13 07:16:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 07:16:08,311 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:16:08,311 INFO L512 BasicCegarLoop]: 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] [2021-10-13 07:16:08,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 07:16:08,311 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 07:16:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:16:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1255554119, now seen corresponding path program 3 times [2021-10-13 07:16:08,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:16:08,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37462718] [2021-10-13 07:16:08,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:16:08,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:16:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:16:08,370 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 07:16:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:16:08,497 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-13 07:16:08,497 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 07:16:08,499 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:16:08,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:16:08,501 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-13 07:16:08,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-13 07:16:08,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-13 07:16:08,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-10-13 07:16:08,502 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:16:08,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 07:16:08,511 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-13 07:16:08,511 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:16:08,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:16:08 BasicIcfg [2021-10-13 07:16:08,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:16:08,638 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:16:08,639 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:16:08,639 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:16:08,640 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:15:45" (3/4) ... [2021-10-13 07:16:08,642 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 07:16:08,825 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:16:08,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:16:08,827 INFO L168 Benchmark]: Toolchain (without parser) took 27207.41 ms. Allocated memory was 125.8 MB in the beginning and 291.5 MB in the end (delta: 165.7 MB). Free memory was 88.9 MB in the beginning and 212.8 MB in the end (delta: -123.9 MB). Peak memory consumption was 187.8 MB. Max. memory is 16.1 GB. [2021-10-13 07:16:08,828 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 81.8 MB. Free memory was 52.3 MB in the beginning and 52.3 MB in the end (delta: 29.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:16:08,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.10 ms. Allocated memory is still 125.8 MB. Free memory was 88.9 MB in the beginning and 87.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 07:16:08,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.23 ms. Allocated memory is still 125.8 MB. Free memory was 87.8 MB in the beginning and 84.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:16:08,830 INFO L168 Benchmark]: Boogie Preprocessor took 92.21 ms. Allocated memory is still 125.8 MB. Free memory was 84.6 MB in the beginning and 82.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:16:08,831 INFO L168 Benchmark]: RCFGBuilder took 2458.37 ms. Allocated memory is still 125.8 MB. Free memory was 82.5 MB in the beginning and 49.1 MB in the end (delta: 33.5 MB). Peak memory consumption was 49.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:16:08,831 INFO L168 Benchmark]: TraceAbstraction took 23510.59 ms. Allocated memory was 125.8 MB in the beginning and 291.5 MB in the end (delta: 165.7 MB). Free memory was 48.4 MB in the beginning and 75.1 MB in the end (delta: -26.7 MB). Peak memory consumption was 138.9 MB. Max. memory is 16.1 GB. [2021-10-13 07:16:08,832 INFO L168 Benchmark]: Witness Printer took 186.96 ms. Allocated memory is still 291.5 MB. Free memory was 75.1 MB in the beginning and 212.8 MB in the end (delta: -137.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:16:08,835 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.28 ms. Allocated memory is still 81.8 MB. Free memory was 52.3 MB in the beginning and 52.3 MB in the end (delta: 29.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 856.10 ms. Allocated memory is still 125.8 MB. Free memory was 88.9 MB in the beginning and 87.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 95.23 ms. Allocated memory is still 125.8 MB. Free memory was 87.8 MB in the beginning and 84.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 92.21 ms. Allocated memory is still 125.8 MB. Free memory was 84.6 MB in the beginning and 82.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2458.37 ms. Allocated memory is still 125.8 MB. Free memory was 82.5 MB in the beginning and 49.1 MB in the end (delta: 33.5 MB). Peak memory consumption was 49.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23510.59 ms. Allocated memory was 125.8 MB in the beginning and 291.5 MB in the end (delta: 165.7 MB). Free memory was 48.4 MB in the beginning and 75.1 MB in the end (delta: -26.7 MB). Peak memory consumption was 138.9 MB. Max. memory is 16.1 GB. * Witness Printer took 186.96 ms. Allocated memory is still 291.5 MB. Free memory was 75.1 MB in the beginning and 212.8 MB in the end (delta: -137.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14851.2ms, 136 PlacesBefore, 45 PlacesAfterwards, 125 TransitionsBefore, 33 TransitionsAfterwards, 2682 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 6536 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3585, positive: 3404, positive conditional: 0, positive unconditional: 3404, negative: 181, negative conditional: 0, negative unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1830, positive: 1791, positive conditional: 0, positive unconditional: 1791, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1830, positive: 1762, positive conditional: 0, positive unconditional: 1762, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 319, negative conditional: 0, negative unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3585, positive: 1613, positive conditional: 0, positive unconditional: 1613, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 1830, unknown conditional: 0, unknown unconditional: 1830] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1469; [L837] FCALL, FORK 0 pthread_create(&t1469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=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] [L838] 0 pthread_t t1470; [L839] FCALL, FORK 0 pthread_create(&t1470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=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] [L840] 0 pthread_t t1471; [L841] FCALL, FORK 0 pthread_create(&t1471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=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] [L842] 0 pthread_t t1472; [L843] FCALL, FORK 0 pthread_create(&t1472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=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] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L778] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] 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) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 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 [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 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 [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 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) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 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 [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 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 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, weak$$choice0=51, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, 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=2, 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: 843]: 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: 839]: 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: 837]: 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: 841]: 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, 159 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 23157.7ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 102.4ms, AutomataDifference: 2520.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15132.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 643 SDtfs, 947 SDslu, 1307 SDs, 0 SdLazy, 460 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 932.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 677.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2762occurred in iteration=0, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1644.9ms AutomataMinimizationTime, 17 MinimizatonAttempts, 706 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 142.7ms SsaConstructionTime, 1032.9ms SatisfiabilityAnalysisTime, 1958.9ms InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 1591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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! [2021-10-13 07:16:08,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a46b62f1-9e6b-4da0-b34c-24195c46cc2c/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...