./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI --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 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:50:04,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:50:04,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:50:04,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:50:04,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:50:04,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:50:04,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:50:04,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:50:04,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:50:04,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:50:04,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:50:04,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:50:04,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:50:04,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:50:04,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:50:04,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:50:04,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:50:04,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:50:04,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:50:04,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:50:04,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:50:04,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:50:04,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:50:04,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:50:04,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:50:04,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:50:04,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:50:04,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:50:04,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:50:04,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:50:04,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:50:04,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:50:04,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:50:04,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:50:04,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:50:04,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:50:04,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:50:04,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:50:04,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:50:04,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:50:04,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:50:04,538 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:50:04,579 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:50:04,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:50:04,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:50:04,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:50:04,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:50:04,589 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:50:04,589 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:50:04,589 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:50:04,589 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:50:04,590 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:50:04,591 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:50:04,592 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:50:04,592 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:50:04,592 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:50:04,593 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:50:04,593 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:50:04,593 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:50:04,594 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:50:04,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:50:04,595 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:50:04,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:50:04,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:50:04,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:50:04,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:50:04,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:50:04,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:50:04,598 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:50:04,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:50:04,600 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:50:04,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:50:04,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:50:04,601 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:50:04,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:50:04,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:50:04,603 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:50:04,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:50:04,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:50:04,603 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:50:04,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:50:04,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:50:04,604 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:50:04,605 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/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_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI 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 -> 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 [2022-11-03 02:50:04,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:50:04,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:50:04,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:50:04,927 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:50:04,928 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:50:04,930 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2022-11-03 02:50:05,020 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/data/d2ac97ba8/3595b850724b4f96b963a6cdb918dfa6/FLAG029e67de7 [2022-11-03 02:50:05,652 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:50:05,653 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2022-11-03 02:50:05,669 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/data/d2ac97ba8/3595b850724b4f96b963a6cdb918dfa6/FLAG029e67de7 [2022-11-03 02:50:05,900 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/data/d2ac97ba8/3595b850724b4f96b963a6cdb918dfa6 [2022-11-03 02:50:05,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:50:05,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:50:05,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:50:05,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:50:05,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:50:05,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:50:05" (1/1) ... [2022-11-03 02:50:05,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@440fc4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:05, skipping insertion in model container [2022-11-03 02:50:05,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:50:05" (1/1) ... [2022-11-03 02:50:05,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:50:06,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:50:06,275 WARN L230 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_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2022-11-03 02:50:06,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:50:06,627 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:50:06,649 WARN L230 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_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2022-11-03 02:50:06,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:50:06,811 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:50:06,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06 WrapperNode [2022-11-03 02:50:06,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:50:06,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:50:06,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:50:06,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:50:06,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06" (1/1) ... [2022-11-03 02:50:06,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06" (1/1) ... [2022-11-03 02:50:06,925 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275 [2022-11-03 02:50:06,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:50:06,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:50:06,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:50:06,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:50:06,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06" (1/1) ... [2022-11-03 02:50:06,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06" (1/1) ... [2022-11-03 02:50:06,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06" (1/1) ... [2022-11-03 02:50:06,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06" (1/1) ... [2022-11-03 02:50:06,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06" (1/1) ... [2022-11-03 02:50:07,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06" (1/1) ... [2022-11-03 02:50:07,005 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06" (1/1) ... [2022-11-03 02:50:07,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06" (1/1) ... [2022-11-03 02:50:07,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:50:07,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:50:07,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:50:07,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:50:07,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06" (1/1) ... [2022-11-03 02:50:07,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:50:07,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:50:07,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:50:07,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:50:07,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:50:07,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 02:50:07,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:50:07,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:50:07,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:50:07,119 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-03 02:50:07,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-03 02:50:07,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-03 02:50:07,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-03 02:50:07,120 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-03 02:50:07,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-03 02:50:07,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:50:07,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 02:50:07,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:50:07,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:50:07,123 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:50:07,302 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:50:07,305 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:50:08,340 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:50:08,915 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:50:08,915 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:50:08,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:50:08 BoogieIcfgContainer [2022-11-03 02:50:08,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:50:08,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:50:08,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:50:08,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:50:08,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:50:05" (1/3) ... [2022-11-03 02:50:08,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c38eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:50:08, skipping insertion in model container [2022-11-03 02:50:08,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:50:06" (2/3) ... [2022-11-03 02:50:08,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c38eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:50:08, skipping insertion in model container [2022-11-03 02:50:08,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:50:08" (3/3) ... [2022-11-03 02:50:08,932 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i [2022-11-03 02:50:08,944 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:50:08,957 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:50:08,959 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 02:50:08,960 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:50:09,056 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 02:50:09,104 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:50:09,123 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 245 flow [2022-11-03 02:50:09,126 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 245 flow [2022-11-03 02:50:09,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-03 02:50:09,191 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-03 02:50:09,191 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 02:50:09,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-03 02:50:09,198 INFO L118 LiptonReduction]: Number of co-enabled transitions 2082 [2022-11-03 02:50:15,861 INFO L133 LiptonReduction]: Checked pairs total: 4969 [2022-11-03 02:50:15,861 INFO L135 LiptonReduction]: Total number of compositions: 99 [2022-11-03 02:50:15,877 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2022-11-03 02:50:15,976 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 872 states, 869 states have (on average 3.346375143843498) internal successors, (2908), 871 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:16,007 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:50:16,014 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23654426, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:50:16,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-03 02:50:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 872 states, 869 states have (on average 3.346375143843498) internal successors, (2908), 871 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:50:16,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:16,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:50:16,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:50:16,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:16,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1072474342, now seen corresponding path program 1 times [2022-11-03 02:50:16,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:16,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615490787] [2022-11-03 02:50:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:16,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:16,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:16,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615490787] [2022-11-03 02:50:16,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615490787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:50:16,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:50:16,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:50:16,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328997633] [2022-11-03 02:50:16,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:50:16,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:50:16,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:16,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:50:16,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:50:16,668 INFO L87 Difference]: Start difference. First operand has 872 states, 869 states have (on average 3.346375143843498) internal successors, (2908), 871 states have internal predecessors, (2908), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:16,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:16,859 INFO L93 Difference]: Finished difference Result 712 states and 2215 transitions. [2022-11-03 02:50:16,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:50:16,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-11-03 02:50:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:16,885 INFO L225 Difference]: With dead ends: 712 [2022-11-03 02:50:16,885 INFO L226 Difference]: Without dead ends: 687 [2022-11-03 02:50:16,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:50:16,890 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:16,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:50:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-11-03 02:50:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2022-11-03 02:50:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 3.1341107871720117) internal successors, (2150), 686 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2022-11-03 02:50:16,996 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 5 [2022-11-03 02:50:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:16,996 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2022-11-03 02:50:16,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:16,997 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2022-11-03 02:50:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:50:16,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:16,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:17,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:50:17,000 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:50:17,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:17,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2112973188, now seen corresponding path program 1 times [2022-11-03 02:50:17,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:17,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665504602] [2022-11-03 02:50:17,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:17,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:17,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:17,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665504602] [2022-11-03 02:50:17,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665504602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:50:17,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:50:17,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:50:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186593779] [2022-11-03 02:50:17,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:50:17,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:50:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:17,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:50:17,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:50:17,513 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:17,708 INFO L93 Difference]: Finished difference Result 762 states and 2295 transitions. [2022-11-03 02:50:17,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:50:17,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-11-03 02:50:17,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:17,724 INFO L225 Difference]: With dead ends: 762 [2022-11-03 02:50:17,724 INFO L226 Difference]: Without dead ends: 637 [2022-11-03 02:50:17,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:50:17,728 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:17,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:50:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-11-03 02:50:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2022-11-03 02:50:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 3.09748427672956) internal successors, (1970), 636 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1970 transitions. [2022-11-03 02:50:17,852 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1970 transitions. Word has length 10 [2022-11-03 02:50:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:17,853 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 1970 transitions. [2022-11-03 02:50:17,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1970 transitions. [2022-11-03 02:50:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:50:17,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:17,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:17,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:50:17,866 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:50:17,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:17,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1117114497, now seen corresponding path program 1 times [2022-11-03 02:50:17,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:17,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118365739] [2022-11-03 02:50:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:17,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:18,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:18,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118365739] [2022-11-03 02:50:18,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118365739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:50:18,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:50:18,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:50:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999228301] [2022-11-03 02:50:18,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:50:18,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:50:18,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:18,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:50:18,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:50:18,298 INFO L87 Difference]: Start difference. First operand 637 states and 1970 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:18,520 INFO L93 Difference]: Finished difference Result 837 states and 2540 transitions. [2022-11-03 02:50:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:50:18,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-11-03 02:50:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:18,524 INFO L225 Difference]: With dead ends: 837 [2022-11-03 02:50:18,525 INFO L226 Difference]: Without dead ends: 437 [2022-11-03 02:50:18,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:50:18,531 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:18,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 15 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:50:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-03 02:50:18,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2022-11-03 02:50:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 436 states have (on average 2.9128440366972477) internal successors, (1270), 436 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1270 transitions. [2022-11-03 02:50:18,552 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1270 transitions. Word has length 11 [2022-11-03 02:50:18,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:18,554 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 1270 transitions. [2022-11-03 02:50:18,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1270 transitions. [2022-11-03 02:50:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:50:18,557 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:18,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:18,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:50:18,557 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:50:18,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:18,558 INFO L85 PathProgramCache]: Analyzing trace with hash -391901732, now seen corresponding path program 1 times [2022-11-03 02:50:18,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:18,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924511719] [2022-11-03 02:50:18,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:18,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:19,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:19,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924511719] [2022-11-03 02:50:19,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924511719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:50:19,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:50:19,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:50:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946097461] [2022-11-03 02:50:19,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:50:19,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:50:19,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:19,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:50:19,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:50:19,426 INFO L87 Difference]: Start difference. First operand 437 states and 1270 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) [2022-11-03 02:50:19,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:19,618 INFO L93 Difference]: Finished difference Result 489 states and 1375 transitions. [2022-11-03 02:50:19,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:50:19,619 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 [2022-11-03 02:50:19,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:19,622 INFO L225 Difference]: With dead ends: 489 [2022-11-03 02:50:19,622 INFO L226 Difference]: Without dead ends: 429 [2022-11-03 02:50:19,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:50:19,623 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:19,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 14 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:50:19,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-11-03 02:50:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2022-11-03 02:50:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 2.892523364485981) internal successors, (1238), 428 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1238 transitions. [2022-11-03 02:50:19,640 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1238 transitions. Word has length 13 [2022-11-03 02:50:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:19,640 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 1238 transitions. [2022-11-03 02:50:19,641 INFO L496 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) [2022-11-03 02:50:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1238 transitions. [2022-11-03 02:50:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:50:19,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:19,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:19,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:50:19,643 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:50:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash 736048808, now seen corresponding path program 1 times [2022-11-03 02:50:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:19,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479386881] [2022-11-03 02:50:19,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:19,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:19,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:19,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479386881] [2022-11-03 02:50:19,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479386881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:50:19,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:50:19,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:50:19,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31015389] [2022-11-03 02:50:19,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:50:19,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:50:19,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:19,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:50:19,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:50:19,891 INFO L87 Difference]: Start difference. First operand 429 states and 1238 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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) [2022-11-03 02:50:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:20,026 INFO L93 Difference]: Finished difference Result 394 states and 1002 transitions. [2022-11-03 02:50:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:50:20,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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 [2022-11-03 02:50:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:20,029 INFO L225 Difference]: With dead ends: 394 [2022-11-03 02:50:20,029 INFO L226 Difference]: Without dead ends: 309 [2022-11-03 02:50:20,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:50:20,031 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:20,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 15 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:50:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-03 02:50:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2022-11-03 02:50:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 2.512987012987013) internal successors, (774), 308 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 774 transitions. [2022-11-03 02:50:20,044 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 774 transitions. Word has length 14 [2022-11-03 02:50:20,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:20,044 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 774 transitions. [2022-11-03 02:50:20,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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) [2022-11-03 02:50:20,045 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 774 transitions. [2022-11-03 02:50:20,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:50:20,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:20,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:20,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:50:20,046 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:50:20,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:20,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1367973734, now seen corresponding path program 1 times [2022-11-03 02:50:20,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:20,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430405846] [2022-11-03 02:50:20,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:20,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:20,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430405846] [2022-11-03 02:50:20,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430405846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:50:20,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:50:20,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:50:20,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716580183] [2022-11-03 02:50:20,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:50:20,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:50:20,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:20,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:50:20,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:50:20,331 INFO L87 Difference]: Start difference. First operand 309 states and 774 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:20,511 INFO L93 Difference]: Finished difference Result 234 states and 528 transitions. [2022-11-03 02:50:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:50:20,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 02:50:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:20,513 INFO L225 Difference]: With dead ends: 234 [2022-11-03 02:50:20,513 INFO L226 Difference]: Without dead ends: 189 [2022-11-03 02:50:20,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:50:20,515 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 52 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:20,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 19 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:50:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-03 02:50:20,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-11-03 02:50:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.223404255319149) internal successors, (418), 188 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 418 transitions. [2022-11-03 02:50:20,523 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 418 transitions. Word has length 15 [2022-11-03 02:50:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:20,523 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 418 transitions. [2022-11-03 02:50:20,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 418 transitions. [2022-11-03 02:50:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 02:50:20,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:20,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:20,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:50:20,525 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:50:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:20,526 INFO L85 PathProgramCache]: Analyzing trace with hash 873828430, now seen corresponding path program 1 times [2022-11-03 02:50:20,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:20,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293757255] [2022-11-03 02:50:20,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:20,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:20,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:20,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293757255] [2022-11-03 02:50:20,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293757255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:50:20,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:50:20,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:50:20,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456643223] [2022-11-03 02:50:20,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:50:20,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:50:20,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:20,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:50:20,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:50:20,886 INFO L87 Difference]: Start difference. First operand 189 states and 418 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:21,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:21,093 INFO L93 Difference]: Finished difference Result 162 states and 362 transitions. [2022-11-03 02:50:21,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:50:21,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 02:50:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:21,095 INFO L225 Difference]: With dead ends: 162 [2022-11-03 02:50:21,095 INFO L226 Difference]: Without dead ends: 151 [2022-11-03 02:50:21,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:50:21,096 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 44 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:21,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 17 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:50:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-03 02:50:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-03 02:50:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.28) internal successors, (342), 150 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 342 transitions. [2022-11-03 02:50:21,105 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 342 transitions. Word has length 18 [2022-11-03 02:50:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:21,106 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 342 transitions. [2022-11-03 02:50:21,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 342 transitions. [2022-11-03 02:50:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:50:21,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:21,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:21,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:50:21,108 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:50:21,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:21,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1883431915, now seen corresponding path program 1 times [2022-11-03 02:50:21,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:21,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969470403] [2022-11-03 02:50:21,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:21,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:21,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:21,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969470403] [2022-11-03 02:50:21,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969470403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:50:21,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:50:21,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:50:21,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618132621] [2022-11-03 02:50:21,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:50:21,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:50:21,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:21,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:50:21,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:50:21,946 INFO L87 Difference]: Start difference. First operand 151 states and 342 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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) [2022-11-03 02:50:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:22,185 INFO L93 Difference]: Finished difference Result 222 states and 504 transitions. [2022-11-03 02:50:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:50:22,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 [2022-11-03 02:50:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:22,187 INFO L225 Difference]: With dead ends: 222 [2022-11-03 02:50:22,187 INFO L226 Difference]: Without dead ends: 71 [2022-11-03 02:50:22,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:50:22,188 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:22,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 21 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:50:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-03 02:50:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-03 02:50:22,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.9142857142857144) internal successors, (134), 70 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 134 transitions. [2022-11-03 02:50:22,192 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 134 transitions. Word has length 22 [2022-11-03 02:50:22,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:22,193 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 134 transitions. [2022-11-03 02:50:22,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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) [2022-11-03 02:50:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 134 transitions. [2022-11-03 02:50:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:50:22,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:22,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:22,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:50:22,194 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:50:22,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:22,195 INFO L85 PathProgramCache]: Analyzing trace with hash -496025941, now seen corresponding path program 2 times [2022-11-03 02:50:22,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:22,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299401510] [2022-11-03 02:50:22,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:22,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:50:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:50:23,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:50:23,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299401510] [2022-11-03 02:50:23,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299401510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:50:23,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:50:23,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:50:23,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125459427] [2022-11-03 02:50:23,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:50:23,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:50:23,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:50:23,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:50:23,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:50:23,585 INFO L87 Difference]: Start difference. First operand 71 states and 134 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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) [2022-11-03 02:50:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:50:23,783 INFO L93 Difference]: Finished difference Result 92 states and 170 transitions. [2022-11-03 02:50:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:50:23,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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 [2022-11-03 02:50:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:50:23,784 INFO L225 Difference]: With dead ends: 92 [2022-11-03 02:50:23,785 INFO L226 Difference]: Without dead ends: 51 [2022-11-03 02:50:23,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:50:23,786 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:50:23,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 12 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:50:23,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-03 02:50:23,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-03 02:50:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.72) internal successors, (86), 50 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:50:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2022-11-03 02:50:23,790 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 22 [2022-11-03 02:50:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:50:23,791 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2022-11-03 02:50:23,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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) [2022-11-03 02:50:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2022-11-03 02:50:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:50:23,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:50:23,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:23,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:50:23,792 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-03 02:50:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:50:23,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1207281223, now seen corresponding path program 3 times [2022-11-03 02:50:23,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:50:23,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412277729] [2022-11-03 02:50:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:50:23,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:50:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:50:23,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:50:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:50:24,018 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:50:24,021 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:50:24,023 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-03 02:50:24,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-03 02:50:24,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-03 02:50:24,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-03 02:50:24,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-03 02:50:24,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-03 02:50:24,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:50:24,034 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:50:24,041 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-03 02:50:24,042 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:50:24,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:50:24 BasicIcfg [2022-11-03 02:50:24,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:50:24,173 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:50:24,173 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:50:24,173 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:50:24,174 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:50:08" (3/4) ... [2022-11-03 02:50:24,176 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 02:50:24,298 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:50:24,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:50:24,299 INFO L158 Benchmark]: Toolchain (without parser) took 18392.61ms. Allocated memory was 100.7MB in the beginning and 287.3MB in the end (delta: 186.6MB). Free memory was 77.1MB in the beginning and 171.7MB in the end (delta: -94.6MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2022-11-03 02:50:24,299 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 100.7MB. Free memory is still 69.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:50:24,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 904.34ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 61.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 02:50:24,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.03ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 58.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:50:24,301 INFO L158 Benchmark]: Boogie Preprocessor took 78.34ms. Allocated memory is still 100.7MB. Free memory was 58.9MB in the beginning and 56.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:50:24,301 INFO L158 Benchmark]: RCFGBuilder took 1905.91ms. Allocated memory was 100.7MB in the beginning and 136.3MB in the end (delta: 35.7MB). Free memory was 56.4MB in the beginning and 69.0MB in the end (delta: -12.6MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2022-11-03 02:50:24,302 INFO L158 Benchmark]: TraceAbstraction took 15249.33ms. Allocated memory was 136.3MB in the beginning and 287.3MB in the end (delta: 151.0MB). Free memory was 67.9MB in the beginning and 184.3MB in the end (delta: -116.4MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2022-11-03 02:50:24,303 INFO L158 Benchmark]: Witness Printer took 125.50ms. Allocated memory is still 287.3MB. Free memory was 184.3MB in the beginning and 171.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 02:50:24,306 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.38ms. Allocated memory is still 100.7MB. Free memory is still 69.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 904.34ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 61.7MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.03ms. Allocated memory is still 100.7MB. Free memory was 61.7MB in the beginning and 58.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.34ms. Allocated memory is still 100.7MB. Free memory was 58.9MB in the beginning and 56.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1905.91ms. Allocated memory was 100.7MB in the beginning and 136.3MB in the end (delta: 35.7MB). Free memory was 56.4MB in the beginning and 69.0MB in the end (delta: -12.6MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15249.33ms. Allocated memory was 136.3MB in the beginning and 287.3MB in the end (delta: 151.0MB). Free memory was 67.9MB in the beginning and 184.3MB in the end (delta: -116.4MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Witness Printer took 125.50ms. Allocated memory is still 287.3MB. Free memory was 184.3MB in the beginning and 171.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 123 PlacesBefore, 37 PlacesAfterwards, 115 TransitionsBefore, 28 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 4969 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2642, positive: 2494, positive conditional: 0, positive unconditional: 2494, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1477, positive: 1436, positive conditional: 0, positive unconditional: 1436, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1477, positive: 1422, positive conditional: 0, positive unconditional: 1422, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 533, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 499, negative conditional: 0, negative unconditional: 499, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2642, positive: 1058, positive conditional: 0, positive unconditional: 1058, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 1477, unknown conditional: 0, unknown unconditional: 1477] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t2284; [L821] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2284, ((void *)0), P0, ((void *)0))=-2, t2284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2285; [L823] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2285, ((void *)0), P1, ((void *)0))=-1, t2284={5:0}, t2285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t2286; [L825] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2286, ((void *)0), P2, ((void *)0))=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - 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: 825]: 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: 823]: 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: 821]: 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 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 323 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 489 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 813 IncrementalHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 46 mSDtfsCounter, 813 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=872occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 02:50:24,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cbdbe4e-9e70-46e3-88c4-9809da7e2d99/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE