./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur --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 c0b350b5c7953744a22c8334b20c4dc8efdff09f1ecb36de8b1744d1e20f0260 --- 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-38b53e6 [2022-11-25 23:57:46,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:57:46,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:57:46,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:57:46,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:57:46,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:57:46,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:57:46,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:57:46,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:57:46,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:57:46,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:57:46,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:57:46,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:57:46,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:57:46,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:57:46,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:57:46,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:57:46,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:57:46,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:57:46,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:57:46,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:57:46,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:57:46,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:57:46,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:57:46,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:57:46,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:57:46,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:57:46,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:57:46,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:57:46,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:57:46,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:57:46,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:57:46,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:57:46,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:57:46,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:57:46,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:57:46,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:57:46,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:57:46,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:57:46,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:57:46,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:57:46,684 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:57:46,707 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:57:46,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:57:46,708 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:57:46,728 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:57:46,729 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:57:46,729 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:57:46,729 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:57:46,729 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:57:46,730 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:57:46,730 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:57:46,730 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:57:46,731 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:57:46,731 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:57:46,731 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:57:46,731 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:57:46,732 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:57:46,732 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:57:46,732 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:57:46,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:57:46,733 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:57:46,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:57:46,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:57:46,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:57:46,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:57:46,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:57:46,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:57:46,735 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:57:46,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:57:46,736 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:57:46,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:57:46,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:57:46,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:57:46,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:57:46,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:57:46,738 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:57:46,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:57:46,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:57:46,739 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:57:46,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:57:46,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:57:46,740 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:57:46,740 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_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/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_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur 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 -> c0b350b5c7953744a22c8334b20c4dc8efdff09f1ecb36de8b1744d1e20f0260 [2022-11-25 23:57:47,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:57:47,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:57:47,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:57:47,137 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:57:47,138 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:57:47,139 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2022-11-25 23:57:50,398 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:57:50,703 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:57:50,704 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2022-11-25 23:57:50,712 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/data/f6b148411/6424be335af84ffb9ff5d282aa6e44de/FLAGe58e263a1 [2022-11-25 23:57:50,730 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/data/f6b148411/6424be335af84ffb9ff5d282aa6e44de [2022-11-25 23:57:50,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:57:50,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:57:50,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:57:50,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:57:50,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:57:50,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:57:50" (1/1) ... [2022-11-25 23:57:50,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21aa515f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:50, skipping insertion in model container [2022-11-25 23:57:50,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:57:50" (1/1) ... [2022-11-25 23:57:50,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:57:50,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:57:50,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:50,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:50,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:50,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:50,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:50,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:50,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:50,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:50,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:50,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:50,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:50,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:50,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:50,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:50,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,014 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_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c[4225,4238] [2022-11-25 23:57:51,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:57:51,051 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:57:51,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:57:51,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:57:51,142 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_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c[4225,4238] [2022-11-25 23:57:51,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:57:51,175 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:57:51,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51 WrapperNode [2022-11-25 23:57:51,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:57:51,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:57:51,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:57:51,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:57:51,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51" (1/1) ... [2022-11-25 23:57:51,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51" (1/1) ... [2022-11-25 23:57:51,256 INFO L138 Inliner]: procedures = 29, calls = 88, calls flagged for inlining = 22, calls inlined = 32, statements flattened = 386 [2022-11-25 23:57:51,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:57:51,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:57:51,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:57:51,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:57:51,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51" (1/1) ... [2022-11-25 23:57:51,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51" (1/1) ... [2022-11-25 23:57:51,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51" (1/1) ... [2022-11-25 23:57:51,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51" (1/1) ... [2022-11-25 23:57:51,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51" (1/1) ... [2022-11-25 23:57:51,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51" (1/1) ... [2022-11-25 23:57:51,305 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51" (1/1) ... [2022-11-25 23:57:51,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51" (1/1) ... [2022-11-25 23:57:51,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:57:51,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:57:51,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:57:51,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:57:51,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51" (1/1) ... [2022-11-25 23:57:51,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:57:51,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:57:51,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:57:51,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:57:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:57:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:57:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:57:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:57:51,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 23:57:51,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 23:57:51,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 23:57:51,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 23:57:51,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-25 23:57:51,415 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-25 23:57:51,415 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-25 23:57:51,415 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-25 23:57:51,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:57:51,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-11-25 23:57:51,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-11-25 23:57:51,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-11-25 23:57:51,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-11-25 23:57:51,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 23:57:51,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 23:57:51,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:57:51,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:57:51,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:57:51,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:57:51,420 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:57:51,582 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:57:51,584 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:57:52,455 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:57:52,849 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:57:52,850 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-25 23:57:52,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:57:52 BoogieIcfgContainer [2022-11-25 23:57:52,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:57:52,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:57:52,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:57:52,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:57:52,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:57:50" (1/3) ... [2022-11-25 23:57:52,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c360f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:57:52, skipping insertion in model container [2022-11-25 23:57:52,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:57:51" (2/3) ... [2022-11-25 23:57:52,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c360f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:57:52, skipping insertion in model container [2022-11-25 23:57:52,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:57:52" (3/3) ... [2022-11-25 23:57:52,869 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2022-11-25 23:57:52,881 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 23:57:52,893 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:57:52,894 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 23:57:52,894 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:57:53,090 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-11-25 23:57:53,148 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:57:53,181 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 307 places, 311 transitions, 694 flow [2022-11-25 23:57:53,184 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 307 places, 311 transitions, 694 flow [2022-11-25 23:57:53,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 311 transitions, 694 flow [2022-11-25 23:57:53,390 INFO L130 PetriNetUnfolder]: 21/265 cut-off events. [2022-11-25 23:57:53,391 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-25 23:57:53,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 265 events. 21/265 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 286 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 225. Up to 3 conditions per place. [2022-11-25 23:57:53,412 INFO L119 LiptonReduction]: Number of co-enabled transitions 8600 [2022-11-25 23:58:09,309 INFO L134 LiptonReduction]: Checked pairs total: 35648 [2022-11-25 23:58:09,310 INFO L136 LiptonReduction]: Total number of compositions: 290 [2022-11-25 23:58:09,321 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 79 transitions, 230 flow [2022-11-25 23:58:09,652 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2245 states, 2244 states have (on average 4.2174688057041) internal successors, (9464), 2244 states have internal predecessors, (9464), 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-25 23:58:09,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:58:09,688 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;@72fda81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:58:09,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-25 23:58:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 2245 states, 2244 states have (on average 4.2174688057041) internal successors, (9464), 2244 states have internal predecessors, (9464), 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-25 23:58:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 23:58:09,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:58:09,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:58:09,747 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:58:09,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:58:09,758 INFO L85 PathProgramCache]: Analyzing trace with hash -902202534, now seen corresponding path program 1 times [2022-11-25 23:58:09,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:58:09,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47702679] [2022-11-25 23:58:09,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:58:09,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:58:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:58:10,189 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-25 23:58:10,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:58:10,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47702679] [2022-11-25 23:58:10,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47702679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:58:10,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:58:10,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:58:10,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544330329] [2022-11-25 23:58:10,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:58:10,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:58:10,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:58:10,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:58:10,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:58:10,250 INFO L87 Difference]: Start difference. First operand has 2245 states, 2244 states have (on average 4.2174688057041) internal successors, (9464), 2244 states have internal predecessors, (9464), 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 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-25 23:58:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:58:10,407 INFO L93 Difference]: Finished difference Result 2245 states and 9396 transitions. [2022-11-25 23:58:10,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:58:10,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 51 [2022-11-25 23:58:10,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:58:10,460 INFO L225 Difference]: With dead ends: 2245 [2022-11-25 23:58:10,460 INFO L226 Difference]: Without dead ends: 2245 [2022-11-25 23:58:10,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:58:10,467 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:58:10,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:58:10,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2022-11-25 23:58:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2022-11-25 23:58:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 2244 states have (on average 4.18716577540107) internal successors, (9396), 2244 states have internal predecessors, (9396), 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-25 23:58:10,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 9396 transitions. [2022-11-25 23:58:10,685 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 9396 transitions. Word has length 51 [2022-11-25 23:58:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:58:10,687 INFO L495 AbstractCegarLoop]: Abstraction has 2245 states and 9396 transitions. [2022-11-25 23:58:10,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-25 23:58:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 9396 transitions. [2022-11-25 23:58:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 23:58:10,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:58:10,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:58:10,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:58:10,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:58:10,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:58:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1224881941, now seen corresponding path program 1 times [2022-11-25 23:58:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:58:10,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040050568] [2022-11-25 23:58:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:58:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:58:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:58:11,707 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-25 23:58:11,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:58:11,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040050568] [2022-11-25 23:58:11,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040050568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:58:11,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:58:11,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:58:11,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004159173] [2022-11-25 23:58:11,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:58:11,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:58:11,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:58:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:58:11,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:58:11,713 INFO L87 Difference]: Start difference. First operand 2245 states and 9396 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-25 23:58:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:58:12,008 INFO L93 Difference]: Finished difference Result 4355 states and 17355 transitions. [2022-11-25 23:58:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:58:12,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2022-11-25 23:58:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:58:12,034 INFO L225 Difference]: With dead ends: 4355 [2022-11-25 23:58:12,035 INFO L226 Difference]: Without dead ends: 2246 [2022-11-25 23:58:12,036 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-25 23:58:12,037 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:58:12,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 66 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:58:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2022-11-25 23:58:12,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2022-11-25 23:58:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 2245 states have (on average 4.1857461024498885) internal successors, (9397), 2245 states have internal predecessors, (9397), 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-25 23:58:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 9397 transitions. [2022-11-25 23:58:12,170 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 9397 transitions. Word has length 52 [2022-11-25 23:58:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:58:12,170 INFO L495 AbstractCegarLoop]: Abstraction has 2246 states and 9397 transitions. [2022-11-25 23:58:12,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-25 23:58:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 9397 transitions. [2022-11-25 23:58:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 23:58:12,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:58:12,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:58:12,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:58:12,187 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:58:12,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:58:12,198 INFO L85 PathProgramCache]: Analyzing trace with hash 537675298, now seen corresponding path program 1 times [2022-11-25 23:58:12,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:58:12,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097357387] [2022-11-25 23:58:12,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:58:12,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:58:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:58:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:58:13,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:58:13,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097357387] [2022-11-25 23:58:13,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097357387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:58:13,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:58:13,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:58:13,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922369460] [2022-11-25 23:58:13,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:58:13,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:58:13,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:58:13,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:58:13,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:58:13,187 INFO L87 Difference]: Start difference. First operand 2246 states and 9397 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-25 23:58:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:58:13,655 INFO L93 Difference]: Finished difference Result 6027 states and 25932 transitions. [2022-11-25 23:58:13,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:58:13,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2022-11-25 23:58:13,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:58:13,715 INFO L225 Difference]: With dead ends: 6027 [2022-11-25 23:58:13,715 INFO L226 Difference]: Without dead ends: 5972 [2022-11-25 23:58:13,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:58:13,721 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 127 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:58:13,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 127 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:58:13,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2022-11-25 23:58:13,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 4216. [2022-11-25 23:58:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4216 states, 4215 states have (on average 4.277342823250296) internal successors, (18029), 4215 states have internal predecessors, (18029), 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-25 23:58:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4216 states to 4216 states and 18029 transitions. [2022-11-25 23:58:13,985 INFO L78 Accepts]: Start accepts. Automaton has 4216 states and 18029 transitions. Word has length 53 [2022-11-25 23:58:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:58:13,987 INFO L495 AbstractCegarLoop]: Abstraction has 4216 states and 18029 transitions. [2022-11-25 23:58:13,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-25 23:58:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 4216 states and 18029 transitions. [2022-11-25 23:58:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 23:58:14,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:58:14,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:58:14,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:58:14,047 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:58:14,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:58:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1870216296, now seen corresponding path program 2 times [2022-11-25 23:58:14,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:58:14,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801282324] [2022-11-25 23:58:14,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:58:14,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:58:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:58:14,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:58:14,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:58:14,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801282324] [2022-11-25 23:58:14,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801282324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:58:14,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:58:14,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:58:14,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883314177] [2022-11-25 23:58:14,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:58:14,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:58:14,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:58:14,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:58:14,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:58:14,931 INFO L87 Difference]: Start difference. First operand 4216 states and 18029 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-25 23:58:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:58:15,333 INFO L93 Difference]: Finished difference Result 5971 states and 25760 transitions. [2022-11-25 23:58:15,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:58:15,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2022-11-25 23:58:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:58:15,402 INFO L225 Difference]: With dead ends: 5971 [2022-11-25 23:58:15,402 INFO L226 Difference]: Without dead ends: 5832 [2022-11-25 23:58:15,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:58:15,408 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 98 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:58:15,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 130 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:58:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5832 states. [2022-11-25 23:58:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5832 to 4210. [2022-11-25 23:58:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4209 states have (on average 4.232359230220955) internal successors, (17814), 4209 states have internal predecessors, (17814), 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-25 23:58:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 17814 transitions. [2022-11-25 23:58:15,702 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 17814 transitions. Word has length 53 [2022-11-25 23:58:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:58:15,703 INFO L495 AbstractCegarLoop]: Abstraction has 4210 states and 17814 transitions. [2022-11-25 23:58:15,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-25 23:58:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 17814 transitions. [2022-11-25 23:58:15,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 23:58:15,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:58:15,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:58:15,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:58:15,731 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:58:15,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:58:15,732 INFO L85 PathProgramCache]: Analyzing trace with hash 392121260, now seen corresponding path program 1 times [2022-11-25 23:58:15,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:58:15,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111699504] [2022-11-25 23:58:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:58:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:58:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:58:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:58:16,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:58:16,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111699504] [2022-11-25 23:58:16,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111699504] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:58:16,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950125071] [2022-11-25 23:58:16,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:58:16,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:58:16,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:58:16,160 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:58:16,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:58:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:58:16,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 23:58:16,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:58:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:58:16,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:58:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:58:16,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950125071] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:58:16,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1960491751] [2022-11-25 23:58:16,728 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:58:16,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:58:16,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-11-25 23:58:16,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553807749] [2022-11-25 23:58:16,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:58:16,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:58:16,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:58:16,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:58:16,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:58:16,744 INFO L87 Difference]: Start difference. First operand 4210 states and 17814 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 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-25 23:58:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:58:17,526 INFO L93 Difference]: Finished difference Result 10634 states and 43796 transitions. [2022-11-25 23:58:17,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 23:58:17,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 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 54 [2022-11-25 23:58:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:58:17,598 INFO L225 Difference]: With dead ends: 10634 [2022-11-25 23:58:17,598 INFO L226 Difference]: Without dead ends: 9428 [2022-11-25 23:58:17,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:58:17,599 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 373 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:58:17,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 240 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:58:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9428 states. [2022-11-25 23:58:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9428 to 5716. [2022-11-25 23:58:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5716 states, 5715 states have (on average 4.200349956255468) internal successors, (24005), 5715 states have internal predecessors, (24005), 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-25 23:58:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5716 states to 5716 states and 24005 transitions. [2022-11-25 23:58:18,035 INFO L78 Accepts]: Start accepts. Automaton has 5716 states and 24005 transitions. Word has length 54 [2022-11-25 23:58:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:58:18,036 INFO L495 AbstractCegarLoop]: Abstraction has 5716 states and 24005 transitions. [2022-11-25 23:58:18,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 10 states have internal predecessors, (123), 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-25 23:58:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 5716 states and 24005 transitions. [2022-11-25 23:58:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 23:58:18,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:58:18,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:58:18,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:58:18,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:58:18,276 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:58:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:58:18,277 INFO L85 PathProgramCache]: Analyzing trace with hash 36635205, now seen corresponding path program 1 times [2022-11-25 23:58:18,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:58:18,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626288574] [2022-11-25 23:58:18,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:58:18,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:58:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:58:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:58:18,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:58:18,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626288574] [2022-11-25 23:58:18,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626288574] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:58:18,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194404692] [2022-11-25 23:58:18,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:58:18,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:58:18,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:58:18,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:58:18,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:58:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:58:19,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 23:58:19,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:58:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:58:19,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:58:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:58:19,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194404692] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:58:19,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [423312443] [2022-11-25 23:58:19,563 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:58:19,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:58:19,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-25 23:58:19,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686700602] [2022-11-25 23:58:19,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:58:19,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:58:19,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:58:19,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:58:19,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:58:19,570 INFO L87 Difference]: Start difference. First operand 5716 states and 24005 transitions. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 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-25 23:58:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:58:19,973 INFO L93 Difference]: Finished difference Result 5016 states and 19684 transitions. [2022-11-25 23:58:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:58:19,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 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 54 [2022-11-25 23:58:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:58:19,998 INFO L225 Difference]: With dead ends: 5016 [2022-11-25 23:58:19,999 INFO L226 Difference]: Without dead ends: 3369 [2022-11-25 23:58:19,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:58:20,000 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:58:20,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 214 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:58:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states. [2022-11-25 23:58:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3369. [2022-11-25 23:58:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3369 states, 3368 states have (on average 4.322446555819478) internal successors, (14558), 3368 states have internal predecessors, (14558), 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-25 23:58:20,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3369 states to 3369 states and 14558 transitions. [2022-11-25 23:58:20,173 INFO L78 Accepts]: Start accepts. Automaton has 3369 states and 14558 transitions. Word has length 54 [2022-11-25 23:58:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:58:20,173 INFO L495 AbstractCegarLoop]: Abstraction has 3369 states and 14558 transitions. [2022-11-25 23:58:20,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 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-25 23:58:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3369 states and 14558 transitions. [2022-11-25 23:58:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 23:58:20,188 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:58:20,189 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:58:20,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:58:20,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 23:58:20,396 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:58:20,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:58:20,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1637027260, now seen corresponding path program 2 times [2022-11-25 23:58:20,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:58:20,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523593800] [2022-11-25 23:58:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:58:20,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:58:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:58:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:58:20,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:58:20,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523593800] [2022-11-25 23:58:20,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523593800] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:58:20,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268562982] [2022-11-25 23:58:20,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:58:20,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:58:20,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:58:20,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:58:20,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:58:21,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:58:21,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:58:21,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 23:58:21,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:58:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:58:21,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:58:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:58:21,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268562982] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 23:58:21,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:58:21,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2022-11-25 23:58:21,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634217258] [2022-11-25 23:58:21,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:58:21,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:58:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:58:21,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:58:21,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:58:21,543 INFO L87 Difference]: Start difference. First operand 3369 states and 14558 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 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-25 23:58:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:58:21,849 INFO L93 Difference]: Finished difference Result 7871 states and 35584 transitions. [2022-11-25 23:58:21,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:58:21,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 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 55 [2022-11-25 23:58:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:58:21,909 INFO L225 Difference]: With dead ends: 7871 [2022-11-25 23:58:21,910 INFO L226 Difference]: Without dead ends: 6905 [2022-11-25 23:58:21,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:58:21,911 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 349 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:58:21,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 54 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:58:21,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6905 states. [2022-11-25 23:58:22,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6905 to 5103. [2022-11-25 23:58:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5103 states, 5102 states have (on average 4.449431595452763) internal successors, (22701), 5102 states have internal predecessors, (22701), 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-25 23:58:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 22701 transitions. [2022-11-25 23:58:22,250 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 22701 transitions. Word has length 55 [2022-11-25 23:58:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:58:22,251 INFO L495 AbstractCegarLoop]: Abstraction has 5103 states and 22701 transitions. [2022-11-25 23:58:22,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 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-25 23:58:22,251 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 22701 transitions. [2022-11-25 23:58:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 23:58:22,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:58:22,270 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:58:22,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:58:22,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 23:58:22,477 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:58:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:58:22,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2108026524, now seen corresponding path program 1 times [2022-11-25 23:58:22,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:58:22,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488895746] [2022-11-25 23:58:22,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:58:22,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:58:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:58:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:58:25,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:58:25,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488895746] [2022-11-25 23:58:25,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488895746] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:58:25,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048535720] [2022-11-25 23:58:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:58:25,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:58:25,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:58:25,612 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:58:25,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66a8a303-ac1d-4ccc-ad9d-8d4e71aff4c8/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:58:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:58:25,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 104 conjunts are in the unsatisfiable core [2022-11-25 23:58:25,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:58:25,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:58:25,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:58:25,970 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:58:25,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2022-11-25 23:58:26,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:58:26,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:58:26,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:58:26,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-25 23:58:26,544 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:58:26,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:58:26,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:58:26,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:58:27,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:58:27,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-11-25 23:58:27,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-11-25 23:58:28,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:58:28,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-11-25 23:58:28,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:58:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:58:28,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:58:28,689 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~x~0.offset 4 (* c_~i2~0 4)))) (and (forall ((v_ArrVal_434 (Array Int Int))) (<= c_~x1~0 (+ c_~s22~0 c_~s12~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork3_~#t6~0#1.base| v_ArrVal_434) c_~x~0.base) .cse0)))) (forall ((v_ArrVal_434 (Array Int Int))) (< (+ c_~s22~0 c_~s12~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork3_~#t6~0#1.base| v_ArrVal_434) c_~x~0.base) .cse0)) (+ c_~x1~0 1))))) is different from false [2022-11-25 23:58:31,610 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4)))) (.cse0 (+ c_~x~0.offset 4 (* c_~i2~0 4)))) (and (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (< (+ c_~s22~0 (select (select (store (store (store |c_#memory_int| |c_thread4Thread1of1ForFork3_~#t5~0#1.base| v_ArrVal_432) |c_thread1Thread1of1ForFork1_~#t3~0#1.base| v_ArrVal_433) |c_thread4Thread1of1ForFork3_~#t6~0#1.base| v_ArrVal_434) c_~x~0.base) .cse0) c_~s12~0) (+ c_~s11~0 .cse1 c_~s21~0 1))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (<= (+ c_~s11~0 .cse1 c_~s21~0) (+ c_~s22~0 (select (select (store (store (store |c_#memory_int| |c_thread4Thread1of1ForFork3_~#t5~0#1.base| v_ArrVal_432) |c_thread1Thread1of1ForFork1_~#t3~0#1.base| v_ArrVal_433) |c_thread4Thread1of1ForFork3_~#t6~0#1.base| v_ArrVal_434) c_~x~0.base) .cse0) c_~s12~0))))) is different from false [2022-11-25 23:58:31,690 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~x~0.offset 4 (* c_~i2~0 4))) (.cse0 (select (select |c_#memory_int| c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))))) (and (forall ((|v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| Int)) (or (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (<= (+ c_~s11~0 .cse0 c_~s21~0) (+ c_~s22~0 c_~s12~0 (select (select (store (store (store |c_#memory_int| |c_thread4Thread1of1ForFork3_~#t5~0#1.base| v_ArrVal_432) |c_thread1Thread1of1ForFork1_~#t3~0#1.base| v_ArrVal_433) |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| v_ArrVal_434) c_~x~0.base) .cse1)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127|)))) (forall ((|v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| Int)) (or (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (< (+ c_~s22~0 c_~s12~0 (select (select (store (store (store |c_#memory_int| |c_thread4Thread1of1ForFork3_~#t5~0#1.base| v_ArrVal_432) |c_thread1Thread1of1ForFork1_~#t3~0#1.base| v_ArrVal_433) |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| v_ArrVal_434) c_~x~0.base) .cse1)) (+ c_~s11~0 .cse0 c_~s21~0 1))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127|)))))) is different from false [2022-11-25 23:58:33,760 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4)))) (.cse0 (+ c_~x~0.offset 4 (* c_~i2~0 4)))) (and (forall ((|v_thread4Thread1of1ForFork3_~#t5~0#1.base_137| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t5~0#1.base_137|)) (forall ((|v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| Int)) (or (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (< (+ c_~s22~0 (select (select (store (store (store |c_#memory_int| |v_thread4Thread1of1ForFork3_~#t5~0#1.base_137| v_ArrVal_432) |c_thread1Thread1of1ForFork1_~#t3~0#1.base| v_ArrVal_433) |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| v_ArrVal_434) c_~x~0.base) .cse0) c_~s12~0) (+ c_~s11~0 .cse1 c_~s21~0 1))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127|)))))) (forall ((|v_thread4Thread1of1ForFork3_~#t5~0#1.base_137| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t5~0#1.base_137|)) (forall ((|v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| Int)) (or (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (<= (+ c_~s11~0 .cse1 c_~s21~0) (+ c_~s22~0 (select (select (store (store (store |c_#memory_int| |v_thread4Thread1of1ForFork3_~#t5~0#1.base_137| v_ArrVal_432) |c_thread1Thread1of1ForFork1_~#t3~0#1.base| v_ArrVal_433) |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| v_ArrVal_434) c_~x~0.base) .cse0) c_~s12~0))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127|)))))))) is different from false [2022-11-25 23:58:33,849 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~x~0.offset 4 (* c_~i2~0 4))) (.cse1 (+ c_~x~0.offset 4 (* c_~i1~0 4)))) (and (forall ((|v_thread4Thread1of1ForFork3_~#t5~0#1.base_137| Int) (v_ArrVal_431 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t5~0#1.base_137|)) (forall ((|v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| Int)) (or (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0#1.base| v_ArrVal_431))) (<= (+ c_~s11~0 (select (select .cse0 c_~x~0.base) .cse1) c_~s21~0) (+ c_~s22~0 c_~s12~0 (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork3_~#t5~0#1.base_137| v_ArrVal_432) |c_thread1Thread1of1ForFork1_~#t3~0#1.base| v_ArrVal_433) |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| v_ArrVal_434) c_~x~0.base) .cse2))))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127|)))))) (forall ((|v_thread4Thread1of1ForFork3_~#t5~0#1.base_137| Int) (v_ArrVal_431 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t5~0#1.base_137|)) (forall ((|v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| Int)) (or (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thread1Thread1of1ForFork1_~#t2~0#1.base| v_ArrVal_431))) (< (+ c_~s22~0 c_~s12~0 (select (select (store (store (store .cse3 |v_thread4Thread1of1ForFork3_~#t5~0#1.base_137| v_ArrVal_432) |c_thread1Thread1of1ForFork1_~#t3~0#1.base| v_ArrVal_433) |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| v_ArrVal_434) c_~x~0.base) .cse2)) (+ c_~s11~0 (select (select .cse3 c_~x~0.base) .cse1) c_~s21~0 1)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127|)))))))) is different from false [2022-11-25 23:58:34,057 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~x~0.offset 4 (* c_~i1~0 4))) (.cse1 (+ c_~x~0.offset 4 (* c_~i2~0 4)))) (and (forall ((|v_thread4Thread1of1ForFork3_~#t5~0#1.base_137| Int) (v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| Int)) (or (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_430) |c_thread1Thread1of1ForFork1_~#t2~0#1.base| v_ArrVal_431))) (< (+ c_~s22~0 c_~s12~0 (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork3_~#t5~0#1.base_137| v_ArrVal_432) |c_thread1Thread1of1ForFork1_~#t3~0#1.base| v_ArrVal_433) |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| v_ArrVal_434) c_~x~0.base) .cse1)) (+ c_~s11~0 (select (select .cse0 c_~x~0.base) .cse2) c_~s21~0 1)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127|)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t5~0#1.base_137|)))) (forall ((|v_thread4Thread1of1ForFork3_~#t5~0#1.base_137| Int) (v_ArrVal_430 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t5~0#1.base_137|)) (forall ((|v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| Int)) (or (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_430) |c_thread1Thread1of1ForFork1_~#t2~0#1.base| v_ArrVal_431))) (<= (+ c_~s11~0 (select (select .cse3 c_~x~0.base) .cse2) c_~s21~0) (+ c_~s22~0 c_~s12~0 (select (select (store (store (store .cse3 |v_thread4Thread1of1ForFork3_~#t5~0#1.base_137| v_ArrVal_432) |c_thread1Thread1of1ForFork1_~#t3~0#1.base| v_ArrVal_433) |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127| v_ArrVal_434) c_~x~0.base) .cse1))))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork3_~#t6~0#1.base_127|)))))))) is different from false [2022-11-25 23:58:49,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:58:49,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 57 [2022-11-25 23:58:49,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1533018102 treesize of output 1477967862