./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 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/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_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW --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-4e7fbc6 [2022-11-23 14:31:55,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:31:55,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:31:55,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:31:55,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:31:55,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:31:55,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:31:55,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:31:55,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:31:55,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:31:55,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:31:55,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:31:55,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:31:55,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:31:55,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:31:55,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:31:55,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:31:55,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:31:55,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:31:55,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:31:55,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:31:55,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:31:55,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:31:55,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:31:55,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:31:55,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:31:55,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:31:55,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:31:55,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:31:55,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:31:55,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:31:55,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:31:55,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:31:55,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:31:55,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:31:55,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:31:55,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:31:55,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:31:55,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:31:55,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:31:55,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:31:55,549 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 14:31:55,585 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:31:55,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:31:55,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:31:55,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:31:55,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:31:55,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:31:55,588 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:31:55,589 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:31:55,589 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:31:55,589 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:31:55,590 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:31:55,591 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:31:55,591 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:31:55,591 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:31:55,591 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:31:55,592 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:31:55,592 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:31:55,592 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:31:55,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:31:55,593 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:31:55,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:31:55,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:31:55,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:31:55,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:31:55,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:31:55,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:31:55,595 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:31:55,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:31:55,595 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:31:55,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:31:55,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:31:55,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:31:55,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:31:55,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:31:55,597 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:31:55,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:31:55,598 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:31:55,598 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:31:55,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:31:55,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:31:55,599 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:31:55,599 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_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/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_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW 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-23 14:31:55,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:31:55,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:31:55,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:31:55,905 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:31:55,906 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:31:55,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2022-11-23 14:31:59,085 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:31:59,359 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:31:59,360 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2022-11-23 14:31:59,372 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/data/e776bef25/0a7364a6a9934399821abb52aa4aa569/FLAGeda836f58 [2022-11-23 14:31:59,387 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/data/e776bef25/0a7364a6a9934399821abb52aa4aa569 [2022-11-23 14:31:59,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:31:59,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:31:59,392 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:31:59,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:31:59,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:31:59,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:31:59" (1/1) ... [2022-11-23 14:31:59,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@559d655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:31:59, skipping insertion in model container [2022-11-23 14:31:59,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:31:59" (1/1) ... [2022-11-23 14:31:59,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:31:59,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:31:59,612 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2022-11-23 14:31:59,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:31:59,913 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:31:59,930 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2022-11-23 14:31:59,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:32:00,030 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:32:00,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00 WrapperNode [2022-11-23 14:32:00,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:32:00,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:32:00,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:32:00,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:32:00,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00" (1/1) ... [2022-11-23 14:32:00,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00" (1/1) ... [2022-11-23 14:32:00,123 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-23 14:32:00,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:32:00,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:32:00,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:32:00,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:32:00,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00" (1/1) ... [2022-11-23 14:32:00,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00" (1/1) ... [2022-11-23 14:32:00,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00" (1/1) ... [2022-11-23 14:32:00,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00" (1/1) ... [2022-11-23 14:32:00,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00" (1/1) ... [2022-11-23 14:32:00,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00" (1/1) ... [2022-11-23 14:32:00,174 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00" (1/1) ... [2022-11-23 14:32:00,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00" (1/1) ... [2022-11-23 14:32:00,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:32:00,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:32:00,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:32:00,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:32:00,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00" (1/1) ... [2022-11-23 14:32:00,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:32:00,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:32:00,224 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:32:00,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:32:00,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 14:32:00,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 14:32:00,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:32:00,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:32:00,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:32:00,263 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 14:32:00,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 14:32:00,263 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 14:32:00,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 14:32:00,263 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 14:32:00,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 14:32:00,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:32:00,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 14:32:00,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:32:00,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:32:00,265 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 14:32:00,428 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:32:00,445 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:32:00,956 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:32:01,103 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:32:01,103 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 14:32:01,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:32:01 BoogieIcfgContainer [2022-11-23 14:32:01,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:32:01,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:32:01,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:32:01,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:32:01,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:31:59" (1/3) ... [2022-11-23 14:32:01,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628d30dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:32:01, skipping insertion in model container [2022-11-23 14:32:01,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:32:00" (2/3) ... [2022-11-23 14:32:01,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628d30dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:32:01, skipping insertion in model container [2022-11-23 14:32:01,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:32:01" (3/3) ... [2022-11-23 14:32:01,121 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i [2022-11-23 14:32:01,132 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 14:32:01,143 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:32:01,144 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 14:32:01,144 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 14:32:01,234 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 14:32:01,276 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 14:32:01,292 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 245 flow [2022-11-23 14:32:01,295 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 245 flow [2022-11-23 14:32:01,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-23 14:32:01,357 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-23 14:32:01,358 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 14:32:01,363 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-23 14:32:01,366 INFO L119 LiptonReduction]: Number of co-enabled transitions 2082 [2022-11-23 14:32:07,530 INFO L134 LiptonReduction]: Checked pairs total: 5750 [2022-11-23 14:32:07,531 INFO L136 LiptonReduction]: Total number of compositions: 103 [2022-11-23 14:32:07,540 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2022-11-23 14:32:07,640 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 722 states, 719 states have (on average 3.189151599443672) internal successors, (2293), 721 states have internal predecessors, (2293), 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-23 14:32:07,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:32:07,665 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;@4f25770b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:32:07,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 14:32:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 722 states, 719 states have (on average 3.189151599443672) internal successors, (2293), 721 states have internal predecessors, (2293), 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-23 14:32:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 14:32:07,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:07,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 14:32:07,677 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-23 14:32:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:32:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash 474025054, now seen corresponding path program 1 times [2022-11-23 14:32:07,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:32:07,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47974358] [2022-11-23 14:32:07,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:07,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:32:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:08,141 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-23 14:32:08,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:32:08,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47974358] [2022-11-23 14:32:08,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47974358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:32:08,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:32:08,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:32:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657032263] [2022-11-23 14:32:08,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:32:08,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:32:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:32:08,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:32:08,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:32:08,203 INFO L87 Difference]: Start difference. First operand has 722 states, 719 states have (on average 3.189151599443672) internal successors, (2293), 721 states have internal predecessors, (2293), 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-23 14:32:08,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:08,355 INFO L93 Difference]: Finished difference Result 587 states and 1790 transitions. [2022-11-23 14:32:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:32:08,357 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-23 14:32:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:32:08,374 INFO L225 Difference]: With dead ends: 587 [2022-11-23 14:32:08,374 INFO L226 Difference]: Without dead ends: 562 [2022-11-23 14:32:08,375 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-23 14:32:08,378 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:32:08,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:32:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-23 14:32:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-11-23 14:32:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 3.0748663101604277) internal successors, (1725), 561 states have internal predecessors, (1725), 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-23 14:32:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2022-11-23 14:32:08,460 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2022-11-23 14:32:08,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:32:08,461 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2022-11-23 14:32:08,461 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-23 14:32:08,461 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2022-11-23 14:32:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:32:08,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:08,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:32:08,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:32:08,463 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-23 14:32:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:32:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash -977599697, now seen corresponding path program 1 times [2022-11-23 14:32:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:32:08,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881565704] [2022-11-23 14:32:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:08,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:32:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:08,824 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-23 14:32:08,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:32:08,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881565704] [2022-11-23 14:32:08,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881565704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:32:08,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:32:08,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:32:08,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801525960] [2022-11-23 14:32:08,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:32:08,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:32:08,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:32:08,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:32:08,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:32:08,829 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:08,903 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2022-11-23 14:32:08,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:32:08,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 14:32:08,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:32:08,912 INFO L225 Difference]: With dead ends: 537 [2022-11-23 14:32:08,913 INFO L226 Difference]: Without dead ends: 537 [2022-11-23 14:32:08,914 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-23 14:32:08,916 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:32:08,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:32:08,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-11-23 14:32:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-11-23 14:32:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 3.050373134328358) internal successors, (1635), 536 states have internal predecessors, (1635), 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-23 14:32:08,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2022-11-23 14:32:08,967 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 9 [2022-11-23 14:32:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:32:08,968 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2022-11-23 14:32:08,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2022-11-23 14:32:08,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:32:08,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:08,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:32:08,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:32:08,973 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-23 14:32:08,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:32:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash -240820937, now seen corresponding path program 1 times [2022-11-23 14:32:08,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:32:08,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666396798] [2022-11-23 14:32:08,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:08,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:32:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:09,200 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-23 14:32:09,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:32:09,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666396798] [2022-11-23 14:32:09,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666396798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:32:09,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:32:09,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:32:09,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742104713] [2022-11-23 14:32:09,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:32:09,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:32:09,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:32:09,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:32:09,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:32:09,203 INFO L87 Difference]: Start difference. First operand 537 states and 1635 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-23 14:32:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:09,329 INFO L93 Difference]: Finished difference Result 677 states and 2012 transitions. [2022-11-23 14:32:09,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:32:09,329 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-23 14:32:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:32:09,332 INFO L225 Difference]: With dead ends: 677 [2022-11-23 14:32:09,332 INFO L226 Difference]: Without dead ends: 377 [2022-11-23 14:32:09,334 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-23 14:32:09,337 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:32:09,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 7 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:32:09,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-23 14:32:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-11-23 14:32:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 2.8643617021276597) internal successors, (1077), 376 states have internal predecessors, (1077), 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-23 14:32:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1077 transitions. [2022-11-23 14:32:09,355 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1077 transitions. Word has length 10 [2022-11-23 14:32:09,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:32:09,357 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 1077 transitions. [2022-11-23 14:32:09,357 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-23 14:32:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1077 transitions. [2022-11-23 14:32:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 14:32:09,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:09,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:32:09,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:32:09,364 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-23 14:32:09,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:32:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash 499193705, now seen corresponding path program 1 times [2022-11-23 14:32:09,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:32:09,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803502780] [2022-11-23 14:32:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:09,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:32:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:10,023 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-23 14:32:10,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:32:10,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803502780] [2022-11-23 14:32:10,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803502780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:32:10,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:32:10,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:32:10,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941242269] [2022-11-23 14:32:10,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:32:10,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:32:10,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:32:10,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:32:10,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:32:10,032 INFO L87 Difference]: Start difference. First operand 377 states and 1077 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:10,138 INFO L93 Difference]: Finished difference Result 373 states and 1061 transitions. [2022-11-23 14:32:10,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:32:10,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 14:32:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:32:10,142 INFO L225 Difference]: With dead ends: 373 [2022-11-23 14:32:10,142 INFO L226 Difference]: Without dead ends: 373 [2022-11-23 14:32:10,142 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-23 14:32:10,143 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:32:10,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 7 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:32:10,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-11-23 14:32:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2022-11-23 14:32:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 2.8521505376344085) internal successors, (1061), 372 states have internal predecessors, (1061), 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-23 14:32:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1061 transitions. [2022-11-23 14:32:10,161 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1061 transitions. Word has length 12 [2022-11-23 14:32:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:32:10,162 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 1061 transitions. [2022-11-23 14:32:10,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1061 transitions. [2022-11-23 14:32:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:32:10,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:10,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:32:10,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 14:32:10,164 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-23 14:32:10,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:32:10,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1704909937, now seen corresponding path program 1 times [2022-11-23 14:32:10,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:32:10,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204371085] [2022-11-23 14:32:10,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:10,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:32:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:10,381 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-23 14:32:10,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:32:10,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204371085] [2022-11-23 14:32:10,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204371085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:32:10,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:32:10,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:32:10,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083169150] [2022-11-23 14:32:10,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:32:10,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:32:10,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:32:10,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:32:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:32:10,384 INFO L87 Difference]: Start difference. First operand 373 states and 1061 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-23 14:32:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:10,499 INFO L93 Difference]: Finished difference Result 358 states and 905 transitions. [2022-11-23 14:32:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:32:10,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-23 14:32:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:32:10,501 INFO L225 Difference]: With dead ends: 358 [2022-11-23 14:32:10,502 INFO L226 Difference]: Without dead ends: 273 [2022-11-23 14:32:10,502 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-23 14:32:10,502 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:32:10,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:32:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-11-23 14:32:10,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2022-11-23 14:32:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 2.488970588235294) internal successors, (677), 272 states have internal predecessors, (677), 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-23 14:32:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 677 transitions. [2022-11-23 14:32:10,512 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 677 transitions. Word has length 13 [2022-11-23 14:32:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:32:10,513 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 677 transitions. [2022-11-23 14:32:10,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-23 14:32:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 677 transitions. [2022-11-23 14:32:10,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 14:32:10,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:10,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:32:10,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 14:32:10,514 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-23 14:32:10,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:32:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1616750722, now seen corresponding path program 1 times [2022-11-23 14:32:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:32:10,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047299600] [2022-11-23 14:32:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:32:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:10,744 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-23 14:32:10,744 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:32:10,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047299600] [2022-11-23 14:32:10,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047299600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:32:10,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:32:10,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:32:10,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831429044] [2022-11-23 14:32:10,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:32:10,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:32:10,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:32:10,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:32:10,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:32:10,747 INFO L87 Difference]: Start difference. First operand 273 states and 677 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:10,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:10,900 INFO L93 Difference]: Finished difference Result 224 states and 509 transitions. [2022-11-23 14:32:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:32:10,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 14:32:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:32:10,902 INFO L225 Difference]: With dead ends: 224 [2022-11-23 14:32:10,902 INFO L226 Difference]: Without dead ends: 179 [2022-11-23 14:32:10,903 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-23 14:32:10,903 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:32:10,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 19 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:32:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-23 14:32:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-11-23 14:32:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 2.241573033707865) internal successors, (399), 178 states have internal predecessors, (399), 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-23 14:32:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 399 transitions. [2022-11-23 14:32:10,909 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 399 transitions. Word has length 14 [2022-11-23 14:32:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:32:10,910 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 399 transitions. [2022-11-23 14:32:10,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 399 transitions. [2022-11-23 14:32:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 14:32:10,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:10,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:32:10,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 14:32:10,927 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-23 14:32:10,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:32:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1747230565, now seen corresponding path program 1 times [2022-11-23 14:32:10,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:32:10,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016354570] [2022-11-23 14:32:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:10,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:32:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:11,180 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-23 14:32:11,180 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:32:11,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016354570] [2022-11-23 14:32:11,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016354570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:32:11,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:32:11,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:32:11,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173698598] [2022-11-23 14:32:11,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:32:11,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:32:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:32:11,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:32:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:32:11,183 INFO L87 Difference]: Start difference. First operand 179 states and 399 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:11,318 INFO L93 Difference]: Finished difference Result 161 states and 361 transitions. [2022-11-23 14:32:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:32:11,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 14:32:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:32:11,319 INFO L225 Difference]: With dead ends: 161 [2022-11-23 14:32:11,320 INFO L226 Difference]: Without dead ends: 150 [2022-11-23 14:32:11,320 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-23 14:32:11,321 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 53 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:32:11,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 15 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:32:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-23 14:32:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-23 14:32:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.2885906040268456) internal successors, (341), 149 states have internal predecessors, (341), 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-23 14:32:11,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 341 transitions. [2022-11-23 14:32:11,326 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 341 transitions. Word has length 17 [2022-11-23 14:32:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:32:11,326 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 341 transitions. [2022-11-23 14:32:11,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 341 transitions. [2022-11-23 14:32:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 14:32:11,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:11,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:32:11,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 14:32:11,328 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-23 14:32:11,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:32:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash 767003020, now seen corresponding path program 1 times [2022-11-23 14:32:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:32:11,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30945378] [2022-11-23 14:32:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:32:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:11,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-23 14:32:11,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:32:11,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30945378] [2022-11-23 14:32:11,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30945378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:32:11,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:32:11,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:32:11,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813950774] [2022-11-23 14:32:11,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:32:11,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:32:11,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:32:11,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:32:11,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:32:11,888 INFO L87 Difference]: Start difference. First operand 150 states and 341 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:12,120 INFO L93 Difference]: Finished difference Result 188 states and 418 transitions. [2022-11-23 14:32:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:32:12,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-23 14:32:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:32:12,122 INFO L225 Difference]: With dead ends: 188 [2022-11-23 14:32:12,122 INFO L226 Difference]: Without dead ends: 70 [2022-11-23 14:32:12,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:32:12,123 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:32:12,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 11 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:32:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-23 14:32:12,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-23 14:32:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.9275362318840579) internal successors, (133), 69 states have internal predecessors, (133), 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-23 14:32:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 133 transitions. [2022-11-23 14:32:12,126 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 133 transitions. Word has length 21 [2022-11-23 14:32:12,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:32:12,126 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 133 transitions. [2022-11-23 14:32:12,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 133 transitions. [2022-11-23 14:32:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 14:32:12,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:12,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:32:12,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 14:32:12,127 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-23 14:32:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:32:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash -765613970, now seen corresponding path program 2 times [2022-11-23 14:32:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:32:12,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269382673] [2022-11-23 14:32:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:32:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:13,810 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-23 14:32:13,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:32:13,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269382673] [2022-11-23 14:32:13,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269382673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:32:13,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:32:13,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 14:32:13,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233766863] [2022-11-23 14:32:13,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:32:13,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 14:32:13,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:32:13,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 14:32:13,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:32:13,815 INFO L87 Difference]: Start difference. First operand 70 states and 133 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:14,077 INFO L93 Difference]: Finished difference Result 90 states and 168 transitions. [2022-11-23 14:32:14,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:32:14,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-23 14:32:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:32:14,078 INFO L225 Difference]: With dead ends: 90 [2022-11-23 14:32:14,079 INFO L226 Difference]: Without dead ends: 50 [2022-11-23 14:32:14,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:32:14,079 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:32:14,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 27 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:32:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-23 14:32:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-23 14:32:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 49 states have internal predecessors, (85), 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-23 14:32:14,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2022-11-23 14:32:14,083 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 21 [2022-11-23 14:32:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:32:14,083 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 85 transitions. [2022-11-23 14:32:14,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions. [2022-11-23 14:32:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 14:32:14,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:14,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:32:14,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 14:32:14,084 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-23 14:32:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:32:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2094149586, now seen corresponding path program 3 times [2022-11-23 14:32:14,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:32:14,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694230810] [2022-11-23 14:32:14,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:14,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:32:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:32:14,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 14:32:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:32:14,205 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 14:32:14,205 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 14:32:14,207 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-23 14:32:14,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-23 14:32:14,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-23 14:32:14,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-23 14:32:14,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-23 14:32:14,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-23 14:32:14,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 14:32:14,212 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:32:14,218 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 14:32:14,218 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:32:14,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:32:14 BasicIcfg [2022-11-23 14:32:14,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:32:14,279 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:32:14,279 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:32:14,279 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:32:14,280 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:32:01" (3/4) ... [2022-11-23 14:32:14,281 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 14:32:14,382 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 14:32:14,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:32:14,383 INFO L158 Benchmark]: Toolchain (without parser) took 14992.15ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 104.2MB in the beginning and 178.9MB in the end (delta: -74.8MB). Peak memory consumption was 87.0MB. Max. memory is 16.1GB. [2022-11-23 14:32:14,383 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 151.0MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:32:14,384 INFO L158 Benchmark]: CACSL2BoogieTranslator took 639.50ms. Allocated memory is still 151.0MB. Free memory was 103.6MB in the beginning and 80.6MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 14:32:14,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.65ms. Allocated memory is still 151.0MB. Free memory was 80.6MB in the beginning and 77.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 14:32:14,384 INFO L158 Benchmark]: Boogie Preprocessor took 66.05ms. Allocated memory is still 151.0MB. Free memory was 77.6MB in the beginning and 76.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:32:14,385 INFO L158 Benchmark]: RCFGBuilder took 914.66ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 75.5MB in the beginning and 165.2MB in the end (delta: -89.7MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2022-11-23 14:32:14,385 INFO L158 Benchmark]: TraceAbstraction took 13169.65ms. Allocated memory was 213.9MB in the beginning and 310.4MB in the end (delta: 96.5MB). Free memory was 164.2MB in the beginning and 189.4MB in the end (delta: -25.2MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2022-11-23 14:32:14,386 INFO L158 Benchmark]: Witness Printer took 103.68ms. Allocated memory is still 310.4MB. Free memory was 189.4MB in the beginning and 178.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-23 14:32:14,388 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.26ms. Allocated memory is still 151.0MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 639.50ms. Allocated memory is still 151.0MB. Free memory was 103.6MB in the beginning and 80.6MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.65ms. Allocated memory is still 151.0MB. Free memory was 80.6MB in the beginning and 77.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.05ms. Allocated memory is still 151.0MB. Free memory was 77.6MB in the beginning and 76.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 914.66ms. Allocated memory was 151.0MB in the beginning and 213.9MB in the end (delta: 62.9MB). Free memory was 75.5MB in the beginning and 165.2MB in the end (delta: -89.7MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13169.65ms. Allocated memory was 213.9MB in the beginning and 310.4MB in the end (delta: 96.5MB). Free memory was 164.2MB in the beginning and 189.4MB in the end (delta: -25.2MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * Witness Printer took 103.68ms. Allocated memory is still 310.4MB. Free memory was 189.4MB in the beginning and 178.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 123 PlacesBefore, 36 PlacesAfterwards, 115 TransitionsBefore, 27 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 5750 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2847, independent: 2668, independent conditional: 0, independent unconditional: 2668, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1524, independent: 1468, independent conditional: 0, independent unconditional: 1468, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1524, independent: 1441, independent conditional: 0, independent unconditional: 1441, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 498, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 449, dependent conditional: 0, dependent unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2847, independent: 1200, independent conditional: 0, independent unconditional: 1200, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 1524, unknown conditional: 0, unknown unconditional: 1524] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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 [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2284, ((void *)0), P0, ((void *)0))=-1, 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 [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2285, ((void *)0), P1, ((void *)0))=0, 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 [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2286, ((void *)0), P2, ((void *)0))=1, 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 [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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 [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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 [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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] 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] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_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] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_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 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __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=2, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [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] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_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] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_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 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [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] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_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] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_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 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [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] 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] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_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] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_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 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, weak$$choice2=0, x=2, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [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] 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] 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] 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] 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] 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] 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] 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] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 260 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 704 IncrementalHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 39 mSDtfsCounter, 704 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=722occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 1042 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-23 14:32:14,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49b168d2-55fd-4a91-9162-fb80b60ab439/bin/utaipan-Q6hlc19bkW/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