./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-max.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_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/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_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/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_20c10e31-dc53-4535-8d21-dbdc69f41d7a/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 306d85d0b5300749928a8392783cd7ec5acf0c4622b6bdba80c3589786dd98ad --- 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-26 00:09:29,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:09:29,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:09:29,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:09:29,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:09:29,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:09:29,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:09:29,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:09:29,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:09:29,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:09:29,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:09:29,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:09:29,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:09:29,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:09:29,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:09:29,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:09:29,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:09:29,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:09:29,439 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:09:29,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:09:29,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:09:29,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:09:29,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:09:29,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:09:29,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:09:29,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:09:29,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:09:29,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:09:29,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:09:29,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:09:29,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:09:29,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:09:29,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:09:29,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:09:29,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:09:29,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:09:29,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:09:29,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:09:29,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:09:29,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:09:29,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:09:29,488 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:09:29,533 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:09:29,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:09:29,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:09:29,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:09:29,536 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:09:29,536 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:09:29,536 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:09:29,537 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:09:29,537 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:09:29,537 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:09:29,538 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:09:29,539 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:09:29,539 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:09:29,539 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:09:29,539 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:09:29,540 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:09:29,540 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:09:29,540 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:09:29,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:09:29,541 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:09:29,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:09:29,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:09:29,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:09:29,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:09:29,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:09:29,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:09:29,543 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:09:29,543 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:09:29,544 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:09:29,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:09:29,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:09:29,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:09:29,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:09:29,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:09:29,546 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:09:29,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:09:29,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:09:29,546 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:09:29,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:09:29,547 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:09:29,547 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:09:29,547 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_20c10e31-dc53-4535-8d21-dbdc69f41d7a/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_20c10e31-dc53-4535-8d21-dbdc69f41d7a/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 -> 306d85d0b5300749928a8392783cd7ec5acf0c4622b6bdba80c3589786dd98ad [2022-11-26 00:09:29,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:09:29,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:09:29,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:09:29,894 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:09:29,894 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:09:29,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2022-11-26 00:09:33,298 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:09:33,550 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:09:33,559 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c [2022-11-26 00:09:33,570 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/data/3aabde623/743248a5d3d245e0a8ec8e6465cba37b/FLAG87b764a7f [2022-11-26 00:09:33,594 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/data/3aabde623/743248a5d3d245e0a8ec8e6465cba37b [2022-11-26 00:09:33,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:09:33,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:09:33,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:09:33,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:09:33,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:09:33,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:33,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b807a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33, skipping insertion in model container [2022-11-26 00:09:33,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:33,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:09:33,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:09:33,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:09:33,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:09:33,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:09:33,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:09:33,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:09:33,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:09:33,848 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_20c10e31-dc53-4535-8d21-dbdc69f41d7a/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c[2823,2836] [2022-11-26 00:09:33,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:09:33,872 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:09:33,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:09:33,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:09:33,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:09:33,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:09:33,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 00:09:33,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 00:09:33,904 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_20c10e31-dc53-4535-8d21-dbdc69f41d7a/sv-benchmarks/c/weaver/popl20-three-array-max.wvr.c[2823,2836] [2022-11-26 00:09:33,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:09:33,928 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:09:33,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33 WrapperNode [2022-11-26 00:09:33,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:09:33,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:09:33,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:09:33,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:09:33,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:33,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:33,987 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 232 [2022-11-26 00:09:33,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:09:33,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:09:33,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:09:33,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:09:34,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:34,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:34,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:34,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:34,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:34,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:34,027 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:34,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:34,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:09:34,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:09:34,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:09:34,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:09:34,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33" (1/1) ... [2022-11-26 00:09:34,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:09:34,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:09:34,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:09:34,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:09:34,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:09:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:09:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:09:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:09:34,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-26 00:09:34,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-26 00:09:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-26 00:09:34,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-26 00:09:34,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-26 00:09:34,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-26 00:09:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:09:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-26 00:09:34,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-26 00:09:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:09:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:09:34,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:09:34,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:09:34,124 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-26 00:09:34,293 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:09:34,296 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:09:34,987 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:09:35,165 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:09:35,165 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-26 00:09:35,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:09:35 BoogieIcfgContainer [2022-11-26 00:09:35,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:09:35,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:09:35,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:09:35,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:09:35,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:09:33" (1/3) ... [2022-11-26 00:09:35,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44801a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:09:35, skipping insertion in model container [2022-11-26 00:09:35,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:09:33" (2/3) ... [2022-11-26 00:09:35,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44801a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:09:35, skipping insertion in model container [2022-11-26 00:09:35,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:09:35" (3/3) ... [2022-11-26 00:09:35,185 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2022-11-26 00:09:35,197 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-26 00:09:35,236 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:09:35,236 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:09:35,236 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 00:09:35,321 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-26 00:09:35,366 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 00:09:35,384 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 298 places, 315 transitions, 654 flow [2022-11-26 00:09:35,388 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 298 places, 315 transitions, 654 flow [2022-11-26 00:09:35,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 315 transitions, 654 flow [2022-11-26 00:09:35,521 INFO L130 PetriNetUnfolder]: 27/312 cut-off events. [2022-11-26 00:09:35,521 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-26 00:09:35,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 312 events. 27/312 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 244. Up to 3 conditions per place. [2022-11-26 00:09:35,532 INFO L119 LiptonReduction]: Number of co-enabled transitions 2634 [2022-11-26 00:09:49,361 INFO L134 LiptonReduction]: Checked pairs total: 4133 [2022-11-26 00:09:49,362 INFO L136 LiptonReduction]: Total number of compositions: 338 [2022-11-26 00:09:49,374 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 38 transitions, 100 flow [2022-11-26 00:09:49,422 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 231 states, 230 states have (on average 3.5217391304347827) internal successors, (810), 230 states have internal predecessors, (810), 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-26 00:09:49,448 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:09:49,455 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;@71eef8b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:09:49,456 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-26 00:09:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 230 states have (on average 3.5217391304347827) internal successors, (810), 230 states have internal predecessors, (810), 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-26 00:09:49,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:09:49,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:09:49,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:09:49,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:09:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:09:49,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2063738835, now seen corresponding path program 1 times [2022-11-26 00:09:49,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:09:49,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87353750] [2022-11-26 00:09:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:09:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:09:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:09:50,249 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-26 00:09:50,250 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:09:50,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87353750] [2022-11-26 00:09:50,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87353750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:09:50,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:09:50,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:09:50,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167478583] [2022-11-26 00:09:50,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:09:50,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:09:50,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:09:50,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:09:50,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:09:50,308 INFO L87 Difference]: Start difference. First operand has 231 states, 230 states have (on average 3.5217391304347827) internal successors, (810), 230 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:09:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:09:50,459 INFO L93 Difference]: Finished difference Result 232 states and 811 transitions. [2022-11-26 00:09:50,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:09:50,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-26 00:09:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:09:50,475 INFO L225 Difference]: With dead ends: 232 [2022-11-26 00:09:50,475 INFO L226 Difference]: Without dead ends: 232 [2022-11-26 00:09:50,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:09:50,480 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:09:50,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:09:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-26 00:09:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-11-26 00:09:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 3.5108225108225106) internal successors, (811), 231 states have internal predecessors, (811), 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-26 00:09:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 811 transitions. [2022-11-26 00:09:50,542 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 811 transitions. Word has length 22 [2022-11-26 00:09:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:09:50,543 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 811 transitions. [2022-11-26 00:09:50,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:09:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 811 transitions. [2022-11-26 00:09:50,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:09:50,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:09:50,547 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] [2022-11-26 00:09:50,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:09:50,548 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:09:50,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:09:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1296481699, now seen corresponding path program 1 times [2022-11-26 00:09:50,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:09:50,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936887130] [2022-11-26 00:09:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:09:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:09:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:09:50,784 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-26 00:09:50,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:09:50,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936887130] [2022-11-26 00:09:50,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936887130] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:09:50,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:09:50,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:09:50,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543365865] [2022-11-26 00:09:50,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:09:50,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:09:50,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:09:50,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:09:50,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:09:50,790 INFO L87 Difference]: Start difference. First operand 232 states and 811 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-26 00:09:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:09:50,922 INFO L93 Difference]: Finished difference Result 234 states and 813 transitions. [2022-11-26 00:09:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:09:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-11-26 00:09:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:09:50,929 INFO L225 Difference]: With dead ends: 234 [2022-11-26 00:09:50,932 INFO L226 Difference]: Without dead ends: 234 [2022-11-26 00:09:50,933 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-26 00:09:50,935 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:09:50,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 6 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:09:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-26 00:09:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-11-26 00:09:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 3.4892703862660945) internal successors, (813), 233 states have internal predecessors, (813), 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-26 00:09:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 813 transitions. [2022-11-26 00:09:50,972 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 813 transitions. Word has length 23 [2022-11-26 00:09:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:09:50,973 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 813 transitions. [2022-11-26 00:09:50,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-26 00:09:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 813 transitions. [2022-11-26 00:09:50,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:09:50,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:09:50,985 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] [2022-11-26 00:09:50,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:09:50,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:09:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:09:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1411315364, now seen corresponding path program 1 times [2022-11-26 00:09:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:09:50,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426559168] [2022-11-26 00:09:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:09:50,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:09:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:09:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:09:51,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:09:51,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426559168] [2022-11-26 00:09:51,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426559168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:09:51,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:09:51,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:09:51,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376784314] [2022-11-26 00:09:51,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:09:51,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:09:51,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:09:51,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:09:51,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:09:51,623 INFO L87 Difference]: Start difference. First operand 234 states and 813 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-26 00:09:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:09:51,741 INFO L93 Difference]: Finished difference Result 413 states and 1459 transitions. [2022-11-26 00:09:51,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:09:51,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-11-26 00:09:51,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:09:51,750 INFO L225 Difference]: With dead ends: 413 [2022-11-26 00:09:51,750 INFO L226 Difference]: Without dead ends: 398 [2022-11-26 00:09:51,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:09:51,755 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:09:51,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:09:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-11-26 00:09:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 308. [2022-11-26 00:09:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.498371335504886) internal successors, (1074), 307 states have internal predecessors, (1074), 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-26 00:09:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 1074 transitions. [2022-11-26 00:09:51,797 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 1074 transitions. Word has length 25 [2022-11-26 00:09:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:09:51,799 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 1074 transitions. [2022-11-26 00:09:51,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-26 00:09:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 1074 transitions. [2022-11-26 00:09:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-26 00:09:51,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:09:51,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:09:51,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:09:51,802 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:09:51,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:09:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1552771130, now seen corresponding path program 1 times [2022-11-26 00:09:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:09:51,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008598204] [2022-11-26 00:09:51,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:09:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:09:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:09:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:09:52,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:09:52,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008598204] [2022-11-26 00:09:52,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008598204] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:09:52,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861090805] [2022-11-26 00:09:52,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:09:52,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:09:52,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:09:52,078 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:09:52,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:09:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:09:52,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:09:52,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:09:52,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:09:52,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:09:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:09:52,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861090805] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:09:52,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [301302837] [2022-11-26 00:09:52,503 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-26 00:09:52,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:09:52,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-26 00:09:52,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206952619] [2022-11-26 00:09:52,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:09:52,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:09:52,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:09:52,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:09:52,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:09:52,508 INFO L87 Difference]: Start difference. First operand 308 states and 1074 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 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-26 00:09:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:09:52,888 INFO L93 Difference]: Finished difference Result 560 states and 1820 transitions. [2022-11-26 00:09:52,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:09:52,889 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 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 27 [2022-11-26 00:09:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:09:52,894 INFO L225 Difference]: With dead ends: 560 [2022-11-26 00:09:52,894 INFO L226 Difference]: Without dead ends: 524 [2022-11-26 00:09:52,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:09:52,895 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 102 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:09:52,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 36 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:09:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-11-26 00:09:52,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 472. [2022-11-26 00:09:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.394904458598726) internal successors, (1599), 471 states have internal predecessors, (1599), 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-26 00:09:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1599 transitions. [2022-11-26 00:09:52,921 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1599 transitions. Word has length 27 [2022-11-26 00:09:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:09:52,921 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 1599 transitions. [2022-11-26 00:09:52,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 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-26 00:09:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1599 transitions. [2022-11-26 00:09:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-26 00:09:52,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:09:52,925 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] [2022-11-26 00:09:52,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 00:09:53,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:09:53,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:09:53,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:09:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1558842492, now seen corresponding path program 1 times [2022-11-26 00:09:53,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:09:53,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976661177] [2022-11-26 00:09:53,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:09:53,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:09:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:09:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:09:53,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:09:53,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976661177] [2022-11-26 00:09:53,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976661177] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:09:53,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418223103] [2022-11-26 00:09:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:09:53,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:09:53,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:09:53,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:09:53,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:09:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:09:53,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:09:53,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:09:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:09:53,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:09:53,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:09:53,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418223103] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:09:53,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1707249597] [2022-11-26 00:09:53,727 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-26 00:09:53,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:09:53,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-26 00:09:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894387462] [2022-11-26 00:09:53,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:09:53,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:09:53,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:09:53,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:09:53,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:09:53,732 INFO L87 Difference]: Start difference. First operand 472 states and 1599 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-26 00:09:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:09:54,129 INFO L93 Difference]: Finished difference Result 368 states and 1219 transitions. [2022-11-26 00:09:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:09:54,130 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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 28 [2022-11-26 00:09:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:09:54,133 INFO L225 Difference]: With dead ends: 368 [2022-11-26 00:09:54,134 INFO L226 Difference]: Without dead ends: 311 [2022-11-26 00:09:54,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:09:54,135 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 77 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:09:54,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 40 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:09:54,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-26 00:09:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2022-11-26 00:09:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 3.4741935483870967) internal successors, (1077), 310 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:09:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 1077 transitions. [2022-11-26 00:09:54,155 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 1077 transitions. Word has length 28 [2022-11-26 00:09:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:09:54,155 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 1077 transitions. [2022-11-26 00:09:54,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 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-26 00:09:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 1077 transitions. [2022-11-26 00:09:54,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:09:54,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:09:54,158 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-11-26 00:09:54,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:09:54,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:09:54,366 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:09:54,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:09:54,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1683757431, now seen corresponding path program 2 times [2022-11-26 00:09:54,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:09:54,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949461223] [2022-11-26 00:09:54,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:09:54,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:09:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:09:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:09:54,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:09:54,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949461223] [2022-11-26 00:09:54,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949461223] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:09:54,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088536373] [2022-11-26 00:09:54,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:09:54,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:09:54,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:09:54,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:09:54,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:09:54,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:09:54,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:09:54,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:09:54,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:09:55,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:09:55,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:09:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:09:55,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088536373] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:09:55,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:09:55,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2022-11-26 00:09:55,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968131399] [2022-11-26 00:09:55,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:09:55,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:09:55,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:09:55,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:09:55,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:09:55,151 INFO L87 Difference]: Start difference. First operand 311 states and 1077 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-26 00:09:55,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:09:55,281 INFO L93 Difference]: Finished difference Result 293 states and 1024 transitions. [2022-11-26 00:09:55,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:09:55,281 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 30 [2022-11-26 00:09:55,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:09:55,284 INFO L225 Difference]: With dead ends: 293 [2022-11-26 00:09:55,285 INFO L226 Difference]: Without dead ends: 293 [2022-11-26 00:09:55,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:09:55,286 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 71 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:09:55,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 7 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:09:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-26 00:09:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 269. [2022-11-26 00:09:55,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 3.462686567164179) internal successors, (928), 268 states have internal predecessors, (928), 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-26 00:09:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 928 transitions. [2022-11-26 00:09:55,300 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 928 transitions. Word has length 30 [2022-11-26 00:09:55,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:09:55,301 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 928 transitions. [2022-11-26 00:09:55,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-26 00:09:55,301 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 928 transitions. [2022-11-26 00:09:55,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:09:55,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:09:55,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-11-26 00:09:55,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:09:55,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:09:55,510 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:09:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:09:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash -10704909, now seen corresponding path program 2 times [2022-11-26 00:09:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:09:55,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643776220] [2022-11-26 00:09:55,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:09:55,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:09:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:09:55,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:09:55,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:09:55,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643776220] [2022-11-26 00:09:55,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643776220] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:09:55,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331686082] [2022-11-26 00:09:55,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:09:55,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:09:55,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:09:55,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:09:55,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:09:56,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 00:09:56,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:09:56,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:09:56,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:09:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:09:56,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:09:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:09:56,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331686082] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:09:56,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:09:56,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2022-11-26 00:09:56,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6586321] [2022-11-26 00:09:56,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:09:56,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:09:56,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:09:56,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:09:56,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:09:56,273 INFO L87 Difference]: Start difference. First operand 269 states and 928 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-26 00:09:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:09:56,438 INFO L93 Difference]: Finished difference Result 347 states and 1216 transitions. [2022-11-26 00:09:56,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:09:56,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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 31 [2022-11-26 00:09:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:09:56,442 INFO L225 Difference]: With dead ends: 347 [2022-11-26 00:09:56,442 INFO L226 Difference]: Without dead ends: 347 [2022-11-26 00:09:56,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:09:56,443 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 56 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:09:56,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 7 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:09:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-26 00:09:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2022-11-26 00:09:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 3.514450867052023) internal successors, (1216), 346 states have internal predecessors, (1216), 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-26 00:09:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1216 transitions. [2022-11-26 00:09:56,460 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 1216 transitions. Word has length 31 [2022-11-26 00:09:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:09:56,461 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 1216 transitions. [2022-11-26 00:09:56,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-26 00:09:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 1216 transitions. [2022-11-26 00:09:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:09:56,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:09:56,463 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-11-26 00:09:56,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:09:56,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:09:56,671 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:09:56,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:09:56,672 INFO L85 PathProgramCache]: Analyzing trace with hash 872525306, now seen corresponding path program 1 times [2022-11-26 00:09:56,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:09:56,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008001926] [2022-11-26 00:09:56,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:09:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:09:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:09:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:09:56,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:09:56,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008001926] [2022-11-26 00:09:56,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008001926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:09:56,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596054095] [2022-11-26 00:09:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:09:56,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:09:56,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:09:56,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:09:56,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:09:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:09:57,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:09:57,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:09:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:09:57,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:09:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:09:57,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596054095] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-26 00:09:57,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-26 00:09:57,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2022-11-26 00:09:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185078712] [2022-11-26 00:09:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:09:57,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:09:57,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:09:57,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:09:57,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:09:57,351 INFO L87 Difference]: Start difference. First operand 347 states and 1216 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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-26 00:09:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:09:57,477 INFO L93 Difference]: Finished difference Result 413 states and 1514 transitions. [2022-11-26 00:09:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:09:57,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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 32 [2022-11-26 00:09:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:09:57,482 INFO L225 Difference]: With dead ends: 413 [2022-11-26 00:09:57,482 INFO L226 Difference]: Without dead ends: 413 [2022-11-26 00:09:57,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:09:57,483 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 80 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:09:57,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 7 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:09:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-26 00:09:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2022-11-26 00:09:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.674757281553398) internal successors, (1514), 412 states have internal predecessors, (1514), 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-26 00:09:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1514 transitions. [2022-11-26 00:09:57,504 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1514 transitions. Word has length 32 [2022-11-26 00:09:57,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:09:57,504 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 1514 transitions. [2022-11-26 00:09:57,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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-26 00:09:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1514 transitions. [2022-11-26 00:09:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 00:09:57,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:09:57,507 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-11-26 00:09:57,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:09:57,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-26 00:09:57,715 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:09:57,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:09:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1485105022, now seen corresponding path program 1 times [2022-11-26 00:09:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:09:57,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191116044] [2022-11-26 00:09:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:09:57,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:09:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:10:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:10:02,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:10:02,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191116044] [2022-11-26 00:10:02,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191116044] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:10:02,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153256936] [2022-11-26 00:10:02,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:10:02,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:10:02,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:10:02,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:10:02,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:10:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:10:02,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-26 00:10:02,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:10:02,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:10:02,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 20 [2022-11-26 00:10:03,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:10:03,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:10:03,273 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:10:03,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-26 00:10:03,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:10:03,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:10:03,496 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:10:03,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-26 00:10:04,349 INFO L321 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2022-11-26 00:10:04,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 80 [2022-11-26 00:10:07,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:10:07,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 326 treesize of output 582 [2022-11-26 00:11:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-26 00:11:26,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:11:35,912 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~maxb~0 |c_thread1Thread1of1ForFork2_#t~mem4|)) (.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (or .cse0 (and (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0)) (forall ((v_ArrVal_498 (Array Int Int))) (< (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_498))) (+ (select (select .cse1 c_~A~0.base) .cse2) (select (select .cse1 c_~B~0.base) .cse3))) (+ c_~maxa~0 c_~maxb~0 1))))) (or (not .cse0) (let ((.cse6 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset))) (and (forall ((v_ArrVal_498 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_498))) (let ((.cse5 (select .cse4 c_~B~0.base))) (< (+ (select (select .cse4 c_~A~0.base) .cse2) (select .cse5 .cse3)) (+ c_~maxa~0 (select .cse5 .cse6) 1))))) (forall ((v_ArrVal_498 (Array Int Int))) (<= c_~maxc~0 (+ c_~maxa~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_498) c_~B~0.base) .cse6))))))))) is different from false [2022-11-26 00:11:35,979 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset)) (.cse0 (<= c_~maxb~0 |c_thread1Thread1of1ForFork2_#t~mem4|))) (and (or .cse0 (and (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0)) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_498))) (+ (select (select .cse1 c_~A~0.base) .cse2) (select (select .cse1 c_~B~0.base) .cse3))) (+ c_~maxa~0 c_~maxb~0 1))))) (or (let ((.cse6 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset))) (and (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_498))) (let ((.cse5 (select .cse4 c_~B~0.base))) (< (+ (select (select .cse4 c_~A~0.base) .cse2) (select .cse5 .cse3)) (+ (select .cse5 .cse6) c_~maxa~0 1))))) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= c_~maxc~0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_498) c_~B~0.base) .cse6) c_~maxa~0))))) (not .cse0)))) is different from false [2022-11-26 00:11:36,026 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse6 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset))) (let ((.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset)) (.cse0 (<= c_~maxb~0 (select (select |c_#memory_int| c_~B~0.base) .cse6)))) (and (or .cse0 (and (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0)) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_498))) (+ (select (select .cse1 c_~A~0.base) .cse2) (select (select .cse1 c_~B~0.base) .cse3))) (+ c_~maxa~0 c_~maxb~0 1))))) (or (and (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_498))) (let ((.cse5 (select .cse4 c_~B~0.base))) (< (+ (select (select .cse4 c_~A~0.base) .cse2) (select .cse5 .cse3)) (+ (select .cse5 .cse6) c_~maxa~0 1))))) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= c_~maxc~0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_498) c_~B~0.base) .cse6) c_~maxa~0)))) (not .cse0))))) (<= c_~maxa~0 |c_thread1Thread1of1ForFork2_#t~mem2|)) is different from false [2022-11-26 00:11:36,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:11:36,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2039 treesize of output 1827 [2022-11-26 00:11:36,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:11:36,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1745 treesize of output 1554 [2022-11-26 00:11:36,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:11:36,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1521 treesize of output 1442 [2022-11-26 00:11:36,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1409 treesize of output 1403 [2022-11-26 00:11:36,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1403 treesize of output 1391 [2022-11-26 00:11:36,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:11:36,373 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 1391 treesize of output 1272 [2022-11-26 00:11:36,425 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:11:36,426 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 1263 treesize of output 1208 [2022-11-26 00:11:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-26 00:11:40,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153256936] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:11:40,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [183246479] [2022-11-26 00:11:40,735 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-26 00:11:40,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:11:40,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 44 [2022-11-26 00:11:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398480902] [2022-11-26 00:11:40,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:11:40,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-26 00:11:40,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:11:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-26 00:11:40,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1626, Unknown=5, NotChecked=252, Total=2070 [2022-11-26 00:11:40,740 INFO L87 Difference]: Start difference. First operand 413 states and 1514 transitions. Second operand has 46 states, 45 states have (on average 2.0) internal successors, (90), 45 states have internal predecessors, (90), 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-26 00:11:48,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:11:50,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:11:52,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:11:54,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:20,503 WARN L233 SmtUtils]: Spent 22.16s on a formula simplification. DAG size of input: 92 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:12:22,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:24,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:26,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:28,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:30,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:32,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:36,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:38,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:40,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:43,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:45,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:47,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:12:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:12:47,684 INFO L93 Difference]: Finished difference Result 1068 states and 4061 transitions. [2022-11-26 00:12:47,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:12:47,684 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.0) internal successors, (90), 45 states have internal predecessors, (90), 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 34 [2022-11-26 00:12:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:12:47,692 INFO L225 Difference]: With dead ends: 1068 [2022-11-26 00:12:47,692 INFO L226 Difference]: Without dead ends: 1057 [2022-11-26 00:12:47,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=583, Invalid=3205, Unknown=6, NotChecked=366, Total=4160 [2022-11-26 00:12:47,694 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 605 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 35 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 36.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:12:47,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 104 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1424 Invalid, 16 Unknown, 422 Unchecked, 36.6s Time] [2022-11-26 00:12:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2022-11-26 00:12:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 539. [2022-11-26 00:12:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 3.7323420074349443) internal successors, (2008), 538 states have internal predecessors, (2008), 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-26 00:12:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 2008 transitions. [2022-11-26 00:12:47,722 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 2008 transitions. Word has length 34 [2022-11-26 00:12:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:12:47,722 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 2008 transitions. [2022-11-26 00:12:47,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.0) internal successors, (90), 45 states have internal predecessors, (90), 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-26 00:12:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 2008 transitions. [2022-11-26 00:12:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 00:12:47,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:12:47,725 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-11-26 00:12:47,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:12:47,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:12:47,932 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:12:47,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:12:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1203513680, now seen corresponding path program 2 times [2022-11-26 00:12:47,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:12:47,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932486327] [2022-11-26 00:12:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:12:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:12:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:12:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:12:48,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:12:48,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932486327] [2022-11-26 00:12:48,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932486327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:12:48,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:12:48,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:12:48,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096944252] [2022-11-26 00:12:48,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:12:48,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:12:48,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:12:48,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:12:48,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:12:48,217 INFO L87 Difference]: Start difference. First operand 539 states and 2008 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-26 00:12:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:12:48,427 INFO L93 Difference]: Finished difference Result 659 states and 2389 transitions. [2022-11-26 00:12:48,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:12:48,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 34 [2022-11-26 00:12:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:12:48,431 INFO L225 Difference]: With dead ends: 659 [2022-11-26 00:12:48,432 INFO L226 Difference]: Without dead ends: 553 [2022-11-26 00:12:48,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:12:48,433 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 43 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:12:48,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 17 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:12:48,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-11-26 00:12:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 417. [2022-11-26 00:12:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.5360576923076925) internal successors, (1471), 416 states have internal predecessors, (1471), 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-26 00:12:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1471 transitions. [2022-11-26 00:12:48,451 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1471 transitions. Word has length 34 [2022-11-26 00:12:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:12:48,451 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 1471 transitions. [2022-11-26 00:12:48,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-26 00:12:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1471 transitions. [2022-11-26 00:12:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 00:12:48,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:12:48,453 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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] [2022-11-26 00:12:48,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:12:48,454 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-26 00:12:48,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:12:48,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1264128626, now seen corresponding path program 3 times [2022-11-26 00:12:48,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:12:48,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941166550] [2022-11-26 00:12:48,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:12:48,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:12:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:12:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-26 00:12:51,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:12:51,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941166550] [2022-11-26 00:12:51,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941166550] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:12:51,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473223918] [2022-11-26 00:12:51,441 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:12:51,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:12:51,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:12:51,443 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:12:51,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20c10e31-dc53-4535-8d21-dbdc69f41d7a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:12:51,626 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:12:51,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:12:51,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-26 00:12:51,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:12:51,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-26 00:12:51,861 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:12:51,861 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-26 00:12:51,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:12:51,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2022-11-26 00:12:52,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:12:52,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:12:52,505 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:12:52,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-26 00:12:52,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:12:52,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:12:52,676 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:12:52,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2022-11-26 00:12:53,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:12:53,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:12:53,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:12:53,055 INFO L321 Elim1Store]: treesize reduction 31, result has 40.4 percent of original size [2022-11-26 00:12:53,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 55 [2022-11-26 00:12:54,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:12:54,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 270 treesize of output 470 [2022-11-26 00:13:29,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:13:29,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:13:37,600 WARN L233 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:13:45,902 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset)) (.cse5 (<= c_~maxb~0 |c_thread1Thread1of1ForFork2_#t~mem4|))) (and (or (let ((.cse1 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset))) (and (forall ((v_ArrVal_617 (Array Int Int)) (v_ArrVal_619 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_617))) (or (forall ((~C~0.offset Int)) (<= c_~maxc~0 (+ (select (select (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) (+ ~C~0.offset 4) v_ArrVal_619)) c_~B~0.base) .cse1) c_~maxa~0))) (< (+ (select (select .cse0 c_~A~0.base) .cse2) (select (select .cse0 c_~B~0.base) .cse3)) v_ArrVal_619)))) (forall ((v_ArrVal_617 (Array Int Int)) (v_ArrVal_619 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_617))) (or (forall ((~C~0.offset Int)) (<= v_ArrVal_619 (+ (select (select (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) (+ ~C~0.offset 4) v_ArrVal_619)) c_~B~0.base) .cse1) c_~maxa~0))) (< (+ (select (select .cse4 c_~A~0.base) .cse2) (select (select .cse4 c_~B~0.base) .cse3)) v_ArrVal_619)))))) (not .cse5)) (or (and (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0)) (forall ((v_ArrVal_617 (Array Int Int))) (< (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_617))) (+ (select (select .cse6 c_~A~0.base) .cse2) (select (select .cse6 c_~B~0.base) .cse3))) (+ c_~maxa~0 c_~maxb~0 1)))) .cse5))) is different from false [2022-11-26 00:13:47,550 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse5 (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset))) (let ((.cse3 (<= c_~maxb~0 (select (select |c_#memory_int| c_~B~0.base) .cse5))) (.cse1 (+ c_~A~0.offset 4)) (.cse2 (+ 4 c_~B~0.offset))) (and (or (and (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0)) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_617 (Array Int Int))) (< (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_616) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_617))) (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2))) (+ c_~maxa~0 c_~maxb~0 1)))) .cse3) (or (not .cse3) (and (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_617 (Array Int Int)) (v_ArrVal_619 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_616) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_617))) (or (forall ((~C~0.offset Int)) (<= v_ArrVal_619 (+ (select (select (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) (+ ~C~0.offset 4) v_ArrVal_619)) c_~B~0.base) .cse5) c_~maxa~0))) (< (+ (select (select .cse4 c_~A~0.base) .cse1) (select (select .cse4 c_~B~0.base) .cse2)) v_ArrVal_619)))) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_617 (Array Int Int)) (v_ArrVal_619 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_616) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_617))) (or (forall ((~C~0.offset Int)) (<= c_~maxc~0 (+ (select (select (store .cse6 c_~C~0.base (store (select .cse6 c_~C~0.base) (+ ~C~0.offset 4) v_ArrVal_619)) c_~B~0.base) .cse5) c_~maxa~0))) (< (+ (select (select .cse6 c_~A~0.base) .cse1) (select (select .cse6 c_~B~0.base) .cse2)) v_ArrVal_619))))))))) (<= c_~maxa~0 |c_thread1Thread1of1ForFork2_#t~mem2|)) is different from false [2022-11-26 00:13:47,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:13:47,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4893 treesize of output 4769 [2022-11-26 00:13:47,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:13:47,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4821 treesize of output 4756 [2022-11-26 00:13:47,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:13:47,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5075 treesize of output 4864 [2022-11-26 00:13:48,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:13:48,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5151 treesize of output 4864 [2022-11-26 00:13:48,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:13:48,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4991 treesize of output 4864 [2022-11-26 00:13:48,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:13:48,313 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 4831 treesize of output 4776 [2022-11-26 00:13:48,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:13:48,435 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 4767 treesize of output 4648