./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c642b478618f67be61772197bb614a61e988cb880f57faee5dd0470714f61e7e --- 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-2329fc7 [2022-12-14 05:12:37,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 05:12:37,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 05:12:37,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 05:12:37,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 05:12:37,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 05:12:37,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 05:12:37,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 05:12:37,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 05:12:37,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 05:12:37,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 05:12:37,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 05:12:37,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 05:12:37,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 05:12:37,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 05:12:37,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 05:12:37,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 05:12:37,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 05:12:37,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 05:12:37,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 05:12:37,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 05:12:37,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 05:12:37,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 05:12:37,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 05:12:37,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 05:12:37,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 05:12:37,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 05:12:37,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 05:12:37,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 05:12:37,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 05:12:37,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 05:12:37,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 05:12:37,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 05:12:37,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 05:12:37,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 05:12:37,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 05:12:37,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 05:12:37,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 05:12:37,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 05:12:37,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 05:12:37,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 05:12:37,536 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 05:12:37,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 05:12:37,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 05:12:37,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 05:12:37,551 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 05:12:37,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 05:12:37,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 05:12:37,552 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 05:12:37,552 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 05:12:37,552 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 05:12:37,552 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 05:12:37,552 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 05:12:37,552 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 05:12:37,552 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 05:12:37,552 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 05:12:37,552 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 05:12:37,553 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 05:12:37,553 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 05:12:37,553 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 05:12:37,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 05:12:37,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 05:12:37,554 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 05:12:37,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 05:12:37,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 05:12:37,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 05:12:37,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 05:12:37,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 05:12:37,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 05:12:37,554 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 05:12:37,554 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 05:12:37,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 05:12:37,555 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 05:12:37,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 05:12:37,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 05:12:37,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 05:12:37,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:12:37,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 05:12:37,555 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 05:12:37,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 05:12:37,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 05:12:37,556 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 05:12:37,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 05:12:37,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 05:12:37,556 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 05:12:37,556 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_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/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_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh 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 ! overflow) ) 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 -> c642b478618f67be61772197bb614a61e988cb880f57faee5dd0470714f61e7e [2022-12-14 05:12:37,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 05:12:37,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 05:12:37,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 05:12:37,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 05:12:37,763 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 05:12:37,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2022-12-14 05:12:40,375 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 05:12:40,534 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 05:12:40,534 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c [2022-12-14 05:12:40,541 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/data/a63c94596/cfc33992c33f4008bccf97efbd3d11b6/FLAG68990deae [2022-12-14 05:12:40,555 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/data/a63c94596/cfc33992c33f4008bccf97efbd3d11b6 [2022-12-14 05:12:40,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 05:12:40,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 05:12:40,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 05:12:40,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 05:12:40,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 05:12:40,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9a0595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40, skipping insertion in model container [2022-12-14 05:12:40,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 05:12:40,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 05:12:40,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:12:40,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:12:40,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:12:40,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:12:40,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:12:40,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:12:40,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:12:40,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:12:40,713 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_40e085a5-66ec-40fe-ab72-93b3ab3363d2/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2022-12-14 05:12:40,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:12:40,733 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 05:12:40,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:12:40,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:12:40,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:12:40,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:12:40,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:12:40,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:12:40,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 05:12:40,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 05:12:40,749 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_40e085a5-66ec-40fe-ab72-93b3ab3363d2/sv-benchmarks/c/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2022-12-14 05:12:40,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:12:40,764 INFO L208 MainTranslator]: Completed translation [2022-12-14 05:12:40,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40 WrapperNode [2022-12-14 05:12:40,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 05:12:40,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 05:12:40,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 05:12:40,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 05:12:40,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,779 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,797 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 178 [2022-12-14 05:12:40,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 05:12:40,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 05:12:40,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 05:12:40,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 05:12:40,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,820 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 05:12:40,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 05:12:40,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 05:12:40,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 05:12:40,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40" (1/1) ... [2022-12-14 05:12:40,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:12:40,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:40,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 05:12:40,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 05:12:40,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 05:12:40,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 05:12:40,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 05:12:40,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 05:12:40,886 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 05:12:40,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 05:12:40,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 05:12:40,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 05:12:40,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 05:12:40,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 05:12:40,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 05:12:40,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 05:12:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 05:12:40,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 05:12:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 05:12:40,889 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 05:12:40,984 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 05:12:40,986 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 05:12:41,254 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 05:12:41,428 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 05:12:41,429 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 05:12:41,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:12:41 BoogieIcfgContainer [2022-12-14 05:12:41,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 05:12:41,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 05:12:41,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 05:12:41,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 05:12:41,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:12:40" (1/3) ... [2022-12-14 05:12:41,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f663d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:12:41, skipping insertion in model container [2022-12-14 05:12:41,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:40" (2/3) ... [2022-12-14 05:12:41,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f663d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:12:41, skipping insertion in model container [2022-12-14 05:12:41,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:12:41" (3/3) ... [2022-12-14 05:12:41,441 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2022-12-14 05:12:41,449 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 05:12:41,460 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 05:12:41,460 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-12-14 05:12:41,460 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 05:12:41,550 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 05:12:41,579 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 05:12:41,593 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 142 transitions, 300 flow [2022-12-14 05:12:41,596 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 142 transitions, 300 flow [2022-12-14 05:12:41,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 142 transitions, 300 flow [2022-12-14 05:12:41,659 INFO L130 PetriNetUnfolder]: 9/140 cut-off events. [2022-12-14 05:12:41,660 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 05:12:41,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 140 events. 9/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 182 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2022-12-14 05:12:41,667 INFO L119 LiptonReduction]: Number of co-enabled transitions 1512 [2022-12-14 05:12:47,464 INFO L134 LiptonReduction]: Checked pairs total: 3231 [2022-12-14 05:12:47,464 INFO L136 LiptonReduction]: Total number of compositions: 149 [2022-12-14 05:12:47,470 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 39 transitions, 94 flow [2022-12-14 05:12:47,494 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 337 states, 255 states have (on average 3.1882352941176473) internal successors, (813), 336 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-12-14 05:12:47,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:12:47,511 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;@43e6435, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:12:47,511 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2022-12-14 05:12:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand has 337 states, 255 states have (on average 3.1882352941176473) internal successors, (813), 336 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-12-14 05:12:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 05:12:47,516 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:47,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 05:12:47,517 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:47,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash 25257, now seen corresponding path program 1 times [2022-12-14 05:12:47,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:47,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350097518] [2022-12-14 05:12:47,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:47,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:47,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:47,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350097518] [2022-12-14 05:12:47,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350097518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:12:47,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:12:47,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 05:12:47,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2568487] [2022-12-14 05:12:47,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:12:47,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:12:47,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:47,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:12:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:12:47,768 INFO L87 Difference]: Start difference. First operand has 337 states, 255 states have (on average 3.1882352941176473) internal successors, (813), 336 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-12-14 05:12:47,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:47,864 INFO L93 Difference]: Finished difference Result 479 states and 1151 transitions. [2022-12-14 05:12:47,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:12:47,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-12-14 05:12:47,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:47,880 INFO L225 Difference]: With dead ends: 479 [2022-12-14 05:12:47,880 INFO L226 Difference]: Without dead ends: 479 [2022-12-14 05:12:47,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:12:47,884 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:47,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:12:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-12-14 05:12:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 242. [2022-12-14 05:12:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 192 states have (on average 3.015625) internal successors, (579), 241 states have internal predecessors, (579), 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-12-14 05:12:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 579 transitions. [2022-12-14 05:12:47,938 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 579 transitions. Word has length 2 [2022-12-14 05:12:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:47,938 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 579 transitions. [2022-12-14 05:12:47,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-12-14 05:12:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 579 transitions. [2022-12-14 05:12:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 05:12:47,939 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:47,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 05:12:47,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 05:12:47,940 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:47,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:47,940 INFO L85 PathProgramCache]: Analyzing trace with hash 783827, now seen corresponding path program 1 times [2022-12-14 05:12:47,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:47,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348023405] [2022-12-14 05:12:47,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:47,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:47,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:47,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348023405] [2022-12-14 05:12:47,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348023405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:12:48,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:12:48,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:12:48,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822559472] [2022-12-14 05:12:48,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:12:48,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:12:48,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:48,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:12:48,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:12:48,002 INFO L87 Difference]: Start difference. First operand 242 states and 579 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-12-14 05:12:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:48,039 INFO L93 Difference]: Finished difference Result 241 states and 578 transitions. [2022-12-14 05:12:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:12:48,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-12-14 05:12:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:48,041 INFO L225 Difference]: With dead ends: 241 [2022-12-14 05:12:48,041 INFO L226 Difference]: Without dead ends: 241 [2022-12-14 05:12:48,041 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-12-14 05:12:48,042 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:48,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:12:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-12-14 05:12:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-12-14 05:12:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 192 states have (on average 3.0104166666666665) internal successors, (578), 240 states have internal predecessors, (578), 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-12-14 05:12:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 578 transitions. [2022-12-14 05:12:48,055 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 578 transitions. Word has length 3 [2022-12-14 05:12:48,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:48,056 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 578 transitions. [2022-12-14 05:12:48,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-12-14 05:12:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 578 transitions. [2022-12-14 05:12:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 05:12:48,056 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:48,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 05:12:48,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 05:12:48,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:48,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:48,057 INFO L85 PathProgramCache]: Analyzing trace with hash 783826, now seen corresponding path program 1 times [2022-12-14 05:12:48,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:48,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069280605] [2022-12-14 05:12:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:48,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:48,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:48,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069280605] [2022-12-14 05:12:48,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069280605] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:48,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342298728] [2022-12-14 05:12:48,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:48,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:48,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:48,129 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:48,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 05:12:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:48,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 05:12:48,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:48,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:48,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342298728] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:48,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [69235120] [2022-12-14 05:12:48,245 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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-12-14 05:12:48,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:48,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-12-14 05:12:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002086919] [2022-12-14 05:12:48,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:12:48,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 05:12:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:48,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 05:12:48,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:12:48,248 INFO L87 Difference]: Start difference. First operand 241 states and 578 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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-12-14 05:12:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:48,421 INFO L93 Difference]: Finished difference Result 1192 states and 2872 transitions. [2022-12-14 05:12:48,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:12:48,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 3 [2022-12-14 05:12:48,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:48,428 INFO L225 Difference]: With dead ends: 1192 [2022-12-14 05:12:48,428 INFO L226 Difference]: Without dead ends: 1192 [2022-12-14 05:12:48,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:12:48,429 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 189 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:48,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 10 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:12:48,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2022-12-14 05:12:48,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 244. [2022-12-14 05:12:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 195 states have (on average 2.994871794871795) internal successors, (584), 243 states have internal predecessors, (584), 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-12-14 05:12:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 584 transitions. [2022-12-14 05:12:48,442 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 584 transitions. Word has length 3 [2022-12-14 05:12:48,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:48,442 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 584 transitions. [2022-12-14 05:12:48,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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-12-14 05:12:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 584 transitions. [2022-12-14 05:12:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 05:12:48,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:48,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 05:12:48,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 05:12:48,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:48,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:48,646 INFO L85 PathProgramCache]: Analyzing trace with hash 753272983, now seen corresponding path program 1 times [2022-12-14 05:12:48,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:48,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756122413] [2022-12-14 05:12:48,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:48,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:48,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756122413] [2022-12-14 05:12:48,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756122413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:12:48,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:12:48,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:12:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530842475] [2022-12-14 05:12:48,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:12:48,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:12:48,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:48,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:12:48,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:12:48,821 INFO L87 Difference]: Start difference. First operand 244 states and 584 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:48,939 INFO L93 Difference]: Finished difference Result 327 states and 756 transitions. [2022-12-14 05:12:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:12:48,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 05:12:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:48,941 INFO L225 Difference]: With dead ends: 327 [2022-12-14 05:12:48,941 INFO L226 Difference]: Without dead ends: 323 [2022-12-14 05:12:48,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:12:48,942 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 48 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:48,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:12:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-12-14 05:12:48,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 285. [2022-12-14 05:12:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 236 states have (on average 2.8940677966101696) internal successors, (683), 284 states have internal predecessors, (683), 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-12-14 05:12:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 683 transitions. [2022-12-14 05:12:48,949 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 683 transitions. Word has length 5 [2022-12-14 05:12:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:48,949 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 683 transitions. [2022-12-14 05:12:48,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 683 transitions. [2022-12-14 05:12:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 05:12:48,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:48,950 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-12-14 05:12:48,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 05:12:48,950 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:48,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:48,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1877007656, now seen corresponding path program 2 times [2022-12-14 05:12:48,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:48,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678434724] [2022-12-14 05:12:48,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:48,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:49,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:49,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678434724] [2022-12-14 05:12:49,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678434724] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:49,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437833568] [2022-12-14 05:12:49,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:12:49,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:49,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:49,034 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:49,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 05:12:49,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 05:12:49,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:12:49,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 05:12:49,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 05:12:49,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:12:49,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437833568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:12:49,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:12:49,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-12-14 05:12:49,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891257165] [2022-12-14 05:12:49,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:12:49,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:12:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:49,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:12:49,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:12:49,122 INFO L87 Difference]: Start difference. First operand 285 states and 683 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-12-14 05:12:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:49,157 INFO L93 Difference]: Finished difference Result 284 states and 682 transitions. [2022-12-14 05:12:49,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:12:49,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 6 [2022-12-14 05:12:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:49,160 INFO L225 Difference]: With dead ends: 284 [2022-12-14 05:12:49,160 INFO L226 Difference]: Without dead ends: 284 [2022-12-14 05:12:49,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:12:49,162 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:49,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:12:49,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-12-14 05:12:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2022-12-14 05:12:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 233 states have (on average 2.9012875536480687) internal successors, (676), 280 states have internal predecessors, (676), 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-12-14 05:12:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 676 transitions. [2022-12-14 05:12:49,168 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 676 transitions. Word has length 6 [2022-12-14 05:12:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:49,169 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 676 transitions. [2022-12-14 05:12:49,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-12-14 05:12:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 676 transitions. [2022-12-14 05:12:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 05:12:49,169 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:49,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 05:12:49,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 05:12:49,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:49,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:49,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:49,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1876995373, now seen corresponding path program 1 times [2022-12-14 05:12:49,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:49,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487110853] [2022-12-14 05:12:49,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:49,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:49,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:49,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487110853] [2022-12-14 05:12:49,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487110853] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:49,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040530635] [2022-12-14 05:12:49,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:49,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:49,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:49,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:49,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 05:12:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:49,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 05:12:49,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:49,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:12:49,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:49,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:12:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:49,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:49,815 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_128 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-12-14 05:12:49,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:49,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-14 05:12:49,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:49,834 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 39 treesize of output 37 [2022-12-14 05:12:49,855 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 7 treesize of output 5 [2022-12-14 05:12:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 05:12:49,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040530635] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:49,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1454809869] [2022-12-14 05:12:49,866 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-12-14 05:12:49,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:49,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-14 05:12:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295122092] [2022-12-14 05:12:49,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:12:49,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 05:12:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:49,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 05:12:49,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2022-12-14 05:12:49,868 INFO L87 Difference]: Start difference. First operand 281 states and 676 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:50,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:50,131 INFO L93 Difference]: Finished difference Result 451 states and 1002 transitions. [2022-12-14 05:12:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 05:12:50,132 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 05:12:50,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:50,133 INFO L225 Difference]: With dead ends: 451 [2022-12-14 05:12:50,133 INFO L226 Difference]: Without dead ends: 451 [2022-12-14 05:12:50,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=132, Unknown=1, NotChecked=24, Total=210 [2022-12-14 05:12:50,134 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 109 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:50,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 20 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 304 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2022-12-14 05:12:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-12-14 05:12:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 283. [2022-12-14 05:12:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 235 states have (on average 2.9106382978723406) internal successors, (684), 282 states have internal predecessors, (684), 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-12-14 05:12:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 684 transitions. [2022-12-14 05:12:50,141 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 684 transitions. Word has length 6 [2022-12-14 05:12:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:50,141 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 684 transitions. [2022-12-14 05:12:50,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 684 transitions. [2022-12-14 05:12:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 05:12:50,142 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:50,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 05:12:50,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 05:12:50,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 05:12:50,343 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:50,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:50,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1876995374, now seen corresponding path program 1 times [2022-12-14 05:12:50,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:50,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657295510] [2022-12-14 05:12:50,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:50,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:50,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:50,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657295510] [2022-12-14 05:12:50,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657295510] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:50,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414142520] [2022-12-14 05:12:50,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:50,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:50,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:50,615 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:50,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 05:12:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:50,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 05:12:50,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:50,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:12:50,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:50,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 05:12:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:50,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:50,785 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_157 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_157) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-12-14 05:12:50,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:50,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-14 05:12:50,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:50,805 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 33 treesize of output 31 [2022-12-14 05:12:50,809 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 5 treesize of output 3 [2022-12-14 05:12:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 05:12:50,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414142520] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:50,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1430086032] [2022-12-14 05:12:50,830 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-12-14 05:12:50,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:50,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-14 05:12:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792350574] [2022-12-14 05:12:50,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:12:50,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 05:12:50,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:50,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 05:12:50,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2022-12-14 05:12:50,832 INFO L87 Difference]: Start difference. First operand 283 states and 684 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:51,060 INFO L93 Difference]: Finished difference Result 450 states and 1000 transitions. [2022-12-14 05:12:51,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 05:12:51,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 05:12:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:51,062 INFO L225 Difference]: With dead ends: 450 [2022-12-14 05:12:51,062 INFO L226 Difference]: Without dead ends: 450 [2022-12-14 05:12:51,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=132, Unknown=1, NotChecked=24, Total=210 [2022-12-14 05:12:51,062 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 104 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:51,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 17 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 262 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2022-12-14 05:12:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-12-14 05:12:51,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 283. [2022-12-14 05:12:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 235 states have (on average 2.9063829787234043) internal successors, (683), 282 states have internal predecessors, (683), 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-12-14 05:12:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 683 transitions. [2022-12-14 05:12:51,083 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 683 transitions. Word has length 6 [2022-12-14 05:12:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:51,083 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 683 transitions. [2022-12-14 05:12:51,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:51,084 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 683 transitions. [2022-12-14 05:12:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 05:12:51,084 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:51,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 05:12:51,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 05:12:51,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 05:12:51,285 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:51,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:51,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1876995376, now seen corresponding path program 1 times [2022-12-14 05:12:51,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:51,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937148773] [2022-12-14 05:12:51,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:51,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:12:51,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:51,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937148773] [2022-12-14 05:12:51,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937148773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:12:51,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:12:51,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 05:12:51,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550756002] [2022-12-14 05:12:51,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:12:51,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:12:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:51,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:12:51,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:12:51,320 INFO L87 Difference]: Start difference. First operand 283 states and 683 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-12-14 05:12:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:51,367 INFO L93 Difference]: Finished difference Result 383 states and 984 transitions. [2022-12-14 05:12:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:12:51,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2022-12-14 05:12:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:51,368 INFO L225 Difference]: With dead ends: 383 [2022-12-14 05:12:51,368 INFO L226 Difference]: Without dead ends: 383 [2022-12-14 05:12:51,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:12:51,369 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:51,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:12:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-12-14 05:12:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 335. [2022-12-14 05:12:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 287 states have (on average 3.062717770034843) internal successors, (879), 334 states have internal predecessors, (879), 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-12-14 05:12:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 879 transitions. [2022-12-14 05:12:51,376 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 879 transitions. Word has length 6 [2022-12-14 05:12:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:51,376 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 879 transitions. [2022-12-14 05:12:51,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-12-14 05:12:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 879 transitions. [2022-12-14 05:12:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 05:12:51,377 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:51,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:51,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 05:12:51,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:51,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1942681877, now seen corresponding path program 1 times [2022-12-14 05:12:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:51,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407405995] [2022-12-14 05:12:51,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:51,589 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:51,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407405995] [2022-12-14 05:12:51,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407405995] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:51,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297073738] [2022-12-14 05:12:51,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:51,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:51,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:51,591 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:51,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 05:12:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:51,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 05:12:51,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:51,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:12:51,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:51,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:12:51,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:51,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:12:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:51,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:51,818 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_204 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_204) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-12-14 05:12:51,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:51,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:12:51,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:51,867 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 143 treesize of output 137 [2022-12-14 05:12:51,873 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 122 treesize of output 114 [2022-12-14 05:12:51,879 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 59 treesize of output 55 [2022-12-14 05:12:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:51,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297073738] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:51,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [481307464] [2022-12-14 05:12:51,929 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-12-14 05:12:51,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:51,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-14 05:12:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570752985] [2022-12-14 05:12:51,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:12:51,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 05:12:51,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:51,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 05:12:51,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=162, Unknown=5, NotChecked=26, Total=240 [2022-12-14 05:12:51,931 INFO L87 Difference]: Start difference. First operand 335 states and 879 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-12-14 05:12:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:52,249 INFO L93 Difference]: Finished difference Result 494 states and 1220 transitions. [2022-12-14 05:12:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 05:12:52,249 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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 7 [2022-12-14 05:12:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:52,252 INFO L225 Difference]: With dead ends: 494 [2022-12-14 05:12:52,252 INFO L226 Difference]: Without dead ends: 494 [2022-12-14 05:12:52,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=227, Unknown=5, NotChecked=32, Total=342 [2022-12-14 05:12:52,253 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 235 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:52,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 21 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 287 Invalid, 0 Unknown, 61 Unchecked, 0.2s Time] [2022-12-14 05:12:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-12-14 05:12:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 366. [2022-12-14 05:12:52,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 318 states have (on average 3.1540880503144653) internal successors, (1003), 365 states have internal predecessors, (1003), 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-12-14 05:12:52,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1003 transitions. [2022-12-14 05:12:52,263 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1003 transitions. Word has length 7 [2022-12-14 05:12:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:52,264 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 1003 transitions. [2022-12-14 05:12:52,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-12-14 05:12:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1003 transitions. [2022-12-14 05:12:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 05:12:52,264 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:52,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:52,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 05:12:52,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:52,466 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:52,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1942681876, now seen corresponding path program 1 times [2022-12-14 05:12:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:52,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069974903] [2022-12-14 05:12:52,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:52,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:52,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:52,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:52,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069974903] [2022-12-14 05:12:52,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069974903] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:52,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666148632] [2022-12-14 05:12:52,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:52,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:52,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:52,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:52,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 05:12:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:52,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 05:12:52,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:52,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:12:52,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:52,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 05:12:52,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:52,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 05:12:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:52,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:52,983 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-12-14 05:12:53,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:53,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-12-14 05:12:53,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:53,025 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 125 treesize of output 119 [2022-12-14 05:12:53,030 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 106 treesize of output 98 [2022-12-14 05:12:53,034 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 98 treesize of output 94 [2022-12-14 05:12:53,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:53,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666148632] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:53,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [295404340] [2022-12-14 05:12:53,088 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-12-14 05:12:53,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:53,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-14 05:12:53,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330349221] [2022-12-14 05:12:53,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:12:53,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 05:12:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:53,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 05:12:53,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=160, Unknown=6, NotChecked=26, Total=240 [2022-12-14 05:12:53,090 INFO L87 Difference]: Start difference. First operand 366 states and 1003 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-12-14 05:12:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:53,418 INFO L93 Difference]: Finished difference Result 471 states and 1149 transitions. [2022-12-14 05:12:53,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 05:12:53,418 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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 7 [2022-12-14 05:12:53,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:53,421 INFO L225 Difference]: With dead ends: 471 [2022-12-14 05:12:53,421 INFO L226 Difference]: Without dead ends: 471 [2022-12-14 05:12:53,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=225, Unknown=6, NotChecked=32, Total=342 [2022-12-14 05:12:53,421 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 158 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:53,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 24 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 308 Invalid, 0 Unknown, 61 Unchecked, 0.2s Time] [2022-12-14 05:12:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-12-14 05:12:53,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 361. [2022-12-14 05:12:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 313 states have (on average 3.0638977635782747) internal successors, (959), 360 states have internal predecessors, (959), 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-12-14 05:12:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 959 transitions. [2022-12-14 05:12:53,429 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 959 transitions. Word has length 7 [2022-12-14 05:12:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:53,429 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 959 transitions. [2022-12-14 05:12:53,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-12-14 05:12:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 959 transitions. [2022-12-14 05:12:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 05:12:53,430 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:53,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:53,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 05:12:53,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 05:12:53,630 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:53,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:53,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1949080010, now seen corresponding path program 1 times [2022-12-14 05:12:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:53,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829573137] [2022-12-14 05:12:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:53,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:53,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829573137] [2022-12-14 05:12:53,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829573137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:12:53,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:12:53,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:12:53,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289472557] [2022-12-14 05:12:53,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:12:53,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:12:53,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:53,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:12:53,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:12:53,669 INFO L87 Difference]: Start difference. First operand 361 states and 959 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-12-14 05:12:53,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:53,752 INFO L93 Difference]: Finished difference Result 339 states and 879 transitions. [2022-12-14 05:12:53,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:12:53,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-12-14 05:12:53,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:53,753 INFO L225 Difference]: With dead ends: 339 [2022-12-14 05:12:53,754 INFO L226 Difference]: Without dead ends: 316 [2022-12-14 05:12:53,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:12:53,754 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:53,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:12:53,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-12-14 05:12:53,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-12-14 05:12:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 268 states have (on average 3.138059701492537) internal successors, (841), 315 states have internal predecessors, (841), 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-12-14 05:12:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 841 transitions. [2022-12-14 05:12:53,761 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 841 transitions. Word has length 7 [2022-12-14 05:12:53,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:53,761 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 841 transitions. [2022-12-14 05:12:53,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-12-14 05:12:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 841 transitions. [2022-12-14 05:12:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 05:12:53,762 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:53,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:53,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 05:12:53,763 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash -93682735, now seen corresponding path program 1 times [2022-12-14 05:12:53,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:53,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884505435] [2022-12-14 05:12:53,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:53,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:53,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:53,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884505435] [2022-12-14 05:12:53,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884505435] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:53,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870344063] [2022-12-14 05:12:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:53,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:53,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:53,833 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:53,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 05:12:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:53,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 05:12:53,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:53,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:53,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870344063] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:53,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [983611238] [2022-12-14 05:12:53,983 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-12-14 05:12:53,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:53,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-14 05:12:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823835268] [2022-12-14 05:12:53,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:12:53,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 05:12:53,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 05:12:53,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-12-14 05:12:53,985 INFO L87 Difference]: Start difference. First operand 316 states and 841 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:54,234 INFO L93 Difference]: Finished difference Result 544 states and 1390 transitions. [2022-12-14 05:12:54,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 05:12:54,234 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 05:12:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:54,237 INFO L225 Difference]: With dead ends: 544 [2022-12-14 05:12:54,237 INFO L226 Difference]: Without dead ends: 536 [2022-12-14 05:12:54,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-12-14 05:12:54,238 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 120 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:54,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 30 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:12:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-12-14 05:12:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 420. [2022-12-14 05:12:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 372 states have (on average 3.14247311827957) internal successors, (1169), 419 states have internal predecessors, (1169), 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-12-14 05:12:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1169 transitions. [2022-12-14 05:12:54,251 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1169 transitions. Word has length 8 [2022-12-14 05:12:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:54,252 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 1169 transitions. [2022-12-14 05:12:54,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1169 transitions. [2022-12-14 05:12:54,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 05:12:54,252 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:54,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:54,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 05:12:54,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 05:12:54,453 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:54,453 INFO L85 PathProgramCache]: Analyzing trace with hash -88654516, now seen corresponding path program 1 times [2022-12-14 05:12:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:54,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081547524] [2022-12-14 05:12:54,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:54,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:54,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:54,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081547524] [2022-12-14 05:12:54,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081547524] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:54,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038210710] [2022-12-14 05:12:54,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:54,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:54,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:54,693 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:54,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 05:12:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:54,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 05:12:54,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:54,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:12:54,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:54,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 05:12:54,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:54,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 05:12:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:54,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:54,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:54,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-12-14 05:12:54,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:54,940 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 125 treesize of output 119 [2022-12-14 05:12:54,945 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 53 treesize of output 49 [2022-12-14 05:12:54,950 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 102 treesize of output 94 [2022-12-14 05:12:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:55,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038210710] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:55,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [305152590] [2022-12-14 05:12:55,002 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-12-14 05:12:55,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:55,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-14 05:12:55,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272543441] [2022-12-14 05:12:55,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:12:55,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 05:12:55,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:55,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 05:12:55,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=186, Unknown=6, NotChecked=0, Total=240 [2022-12-14 05:12:55,004 INFO L87 Difference]: Start difference. First operand 420 states and 1169 transitions. Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-12-14 05:12:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:55,221 INFO L93 Difference]: Finished difference Result 548 states and 1450 transitions. [2022-12-14 05:12:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 05:12:55,221 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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 8 [2022-12-14 05:12:55,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:55,226 INFO L225 Difference]: With dead ends: 548 [2022-12-14 05:12:55,226 INFO L226 Difference]: Without dead ends: 548 [2022-12-14 05:12:55,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=251, Unknown=6, NotChecked=0, Total=342 [2022-12-14 05:12:55,227 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 189 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:55,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 12 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:12:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-12-14 05:12:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 460. [2022-12-14 05:12:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 412 states have (on average 3.2063106796116503) internal successors, (1321), 459 states have internal predecessors, (1321), 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-12-14 05:12:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1321 transitions. [2022-12-14 05:12:55,243 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1321 transitions. Word has length 8 [2022-12-14 05:12:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:55,243 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 1321 transitions. [2022-12-14 05:12:55,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-12-14 05:12:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1321 transitions. [2022-12-14 05:12:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 05:12:55,244 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:55,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:55,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 05:12:55,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:55,445 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:55,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:55,446 INFO L85 PathProgramCache]: Analyzing trace with hash -88654515, now seen corresponding path program 1 times [2022-12-14 05:12:55,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:55,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305836715] [2022-12-14 05:12:55,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:55,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:55,617 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:55,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305836715] [2022-12-14 05:12:55,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305836715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:55,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115812545] [2022-12-14 05:12:55,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:55,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:55,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:55,619 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:55,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 05:12:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:55,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 05:12:55,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:55,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 05:12:55,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:55,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:12:55,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:55,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:12:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:55,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:55,858 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_345 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296))) is different from false [2022-12-14 05:12:55,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:55,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:12:55,874 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:55,874 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 143 treesize of output 137 [2022-12-14 05:12:55,878 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 122 treesize of output 114 [2022-12-14 05:12:55,882 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 114 treesize of output 110 [2022-12-14 05:12:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 05:12:55,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115812545] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:55,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [215631728] [2022-12-14 05:12:55,939 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-12-14 05:12:55,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:55,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-14 05:12:55,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623654669] [2022-12-14 05:12:55,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:12:55,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 05:12:55,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:55,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 05:12:55,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=162, Unknown=5, NotChecked=26, Total=240 [2022-12-14 05:12:55,940 INFO L87 Difference]: Start difference. First operand 460 states and 1321 transitions. Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-12-14 05:12:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:56,144 INFO L93 Difference]: Finished difference Result 514 states and 1358 transitions. [2022-12-14 05:12:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 05:12:56,144 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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 8 [2022-12-14 05:12:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:56,146 INFO L225 Difference]: With dead ends: 514 [2022-12-14 05:12:56,146 INFO L226 Difference]: Without dead ends: 514 [2022-12-14 05:12:56,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=224, Unknown=5, NotChecked=32, Total=342 [2022-12-14 05:12:56,147 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 179 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:56,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 9 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-12-14 05:12:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-12-14 05:12:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 452. [2022-12-14 05:12:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 404 states have (on average 3.136138613861386) internal successors, (1267), 451 states have internal predecessors, (1267), 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-12-14 05:12:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1267 transitions. [2022-12-14 05:12:56,154 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1267 transitions. Word has length 8 [2022-12-14 05:12:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:56,155 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 1267 transitions. [2022-12-14 05:12:56,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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-12-14 05:12:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1267 transitions. [2022-12-14 05:12:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 05:12:56,155 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:56,155 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:56,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 05:12:56,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 05:12:56,356 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:12:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:56,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1744932731, now seen corresponding path program 2 times [2022-12-14 05:12:56,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:56,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942105943] [2022-12-14 05:12:56,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:56,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:56,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:56,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942105943] [2022-12-14 05:12:56,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942105943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:56,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851136811] [2022-12-14 05:12:56,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:12:56,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:56,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:56,592 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:56,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 05:12:56,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 05:12:56,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:12:56,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 05:12:56,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:56,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:12:56,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:56,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:12:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:56,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:56,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:56,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 05:12:56,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:12:56,977 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 47 treesize of output 43 [2022-12-14 05:12:56,981 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 15 treesize of output 9 [2022-12-14 05:12:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:57,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851136811] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:57,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1136802540] [2022-12-14 05:12:57,082 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-12-14 05:12:57,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:57,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 05:12:57,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307974528] [2022-12-14 05:12:57,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:12:57,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 05:12:57,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:57,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 05:12:57,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-12-14 05:12:57,084 INFO L87 Difference]: Start difference. First operand 452 states and 1267 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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-12-14 05:13:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:00,016 INFO L93 Difference]: Finished difference Result 1405 states and 3505 transitions. [2022-12-14 05:13:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 05:13:00,016 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 05:13:00,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:00,022 INFO L225 Difference]: With dead ends: 1405 [2022-12-14 05:13:00,022 INFO L226 Difference]: Without dead ends: 1405 [2022-12-14 05:13:00,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=516, Invalid=2346, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 05:13:00,023 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 487 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:00,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 78 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 05:13:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2022-12-14 05:13:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 542. [2022-12-14 05:13:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 494 states have (on average 3.617408906882591) internal successors, (1787), 541 states have internal predecessors, (1787), 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-12-14 05:13:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1787 transitions. [2022-12-14 05:13:00,036 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1787 transitions. Word has length 9 [2022-12-14 05:13:00,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:00,036 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 1787 transitions. [2022-12-14 05:13:00,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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-12-14 05:13:00,036 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1787 transitions. [2022-12-14 05:13:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 05:13:00,036 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:00,036 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:00,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 05:13:00,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 05:13:00,238 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:00,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1744932732, now seen corresponding path program 1 times [2022-12-14 05:13:00,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:00,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539247205] [2022-12-14 05:13:00,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:00,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:00,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:00,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539247205] [2022-12-14 05:13:00,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539247205] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:00,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268804513] [2022-12-14 05:13:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:00,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:00,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:00,467 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:00,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 05:13:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:00,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 05:13:00,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:00,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:00,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:00,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:00,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:00,679 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 05:13:00,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:00,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-14 05:13:00,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:00,693 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 37 treesize of output 33 [2022-12-14 05:13:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 05:13:00,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268804513] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:00,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1614661235] [2022-12-14 05:13:00,729 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-12-14 05:13:00,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:00,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 05:13:00,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026888200] [2022-12-14 05:13:00,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:00,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 05:13:00,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:00,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 05:13:00,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2022-12-14 05:13:00,730 INFO L87 Difference]: Start difference. First operand 542 states and 1787 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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-12-14 05:13:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:01,362 INFO L93 Difference]: Finished difference Result 865 states and 2534 transitions. [2022-12-14 05:13:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 05:13:01,363 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 05:13:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:01,365 INFO L225 Difference]: With dead ends: 865 [2022-12-14 05:13:01,365 INFO L226 Difference]: Without dead ends: 865 [2022-12-14 05:13:01,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=667, Unknown=1, NotChecked=54, Total=870 [2022-12-14 05:13:01,366 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 136 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:01,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 44 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 852 Invalid, 0 Unknown, 49 Unchecked, 0.4s Time] [2022-12-14 05:13:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2022-12-14 05:13:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 547. [2022-12-14 05:13:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 499 states have (on average 3.6112224448897794) internal successors, (1802), 546 states have internal predecessors, (1802), 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-12-14 05:13:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1802 transitions. [2022-12-14 05:13:01,381 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1802 transitions. Word has length 9 [2022-12-14 05:13:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:01,382 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 1802 transitions. [2022-12-14 05:13:01,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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-12-14 05:13:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1802 transitions. [2022-12-14 05:13:01,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 05:13:01,382 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:01,382 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:01,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 05:13:01,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 05:13:01,583 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:01,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:01,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1744932734, now seen corresponding path program 1 times [2022-12-14 05:13:01,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:01,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205778098] [2022-12-14 05:13:01,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:01,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:13:01,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:01,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205778098] [2022-12-14 05:13:01,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205778098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:13:01,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:13:01,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:13:01,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651689862] [2022-12-14 05:13:01,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:13:01,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:13:01,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:01,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:13:01,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:13:01,653 INFO L87 Difference]: Start difference. First operand 547 states and 1802 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-12-14 05:13:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:01,759 INFO L93 Difference]: Finished difference Result 817 states and 2411 transitions. [2022-12-14 05:13:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:13:01,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 05:13:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:01,763 INFO L225 Difference]: With dead ends: 817 [2022-12-14 05:13:01,763 INFO L226 Difference]: Without dead ends: 817 [2022-12-14 05:13:01,763 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-12-14 05:13:01,764 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 56 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:01,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:13:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-12-14 05:13:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 593. [2022-12-14 05:13:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 545 states have (on average 3.7394495412844035) internal successors, (2038), 592 states have internal predecessors, (2038), 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-12-14 05:13:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 2038 transitions. [2022-12-14 05:13:01,775 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 2038 transitions. Word has length 9 [2022-12-14 05:13:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:01,775 INFO L495 AbstractCegarLoop]: Abstraction has 593 states and 2038 transitions. [2022-12-14 05:13:01,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-12-14 05:13:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 2038 transitions. [2022-12-14 05:13:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 05:13:01,775 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:01,775 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:01,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 05:13:01,776 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1744932735, now seen corresponding path program 1 times [2022-12-14 05:13:01,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:01,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618511713] [2022-12-14 05:13:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:13:01,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:01,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618511713] [2022-12-14 05:13:01,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618511713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:13:01,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:13:01,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:13:01,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489384712] [2022-12-14 05:13:01,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:13:01,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:13:01,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:01,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:13:01,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:13:01,826 INFO L87 Difference]: Start difference. First operand 593 states and 2038 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-12-14 05:13:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:01,925 INFO L93 Difference]: Finished difference Result 813 states and 2315 transitions. [2022-12-14 05:13:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:13:01,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 05:13:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:01,928 INFO L225 Difference]: With dead ends: 813 [2022-12-14 05:13:01,928 INFO L226 Difference]: Without dead ends: 813 [2022-12-14 05:13:01,928 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-12-14 05:13:01,928 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 53 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:01,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 6 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:13:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-12-14 05:13:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 581. [2022-12-14 05:13:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 533 states have (on average 3.596622889305816) internal successors, (1917), 580 states have internal predecessors, (1917), 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-12-14 05:13:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1917 transitions. [2022-12-14 05:13:01,938 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1917 transitions. Word has length 9 [2022-12-14 05:13:01,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:01,938 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1917 transitions. [2022-12-14 05:13:01,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-12-14 05:13:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1917 transitions. [2022-12-14 05:13:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 05:13:01,939 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:01,939 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:01,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 05:13:01,939 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:01,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:01,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1741656483, now seen corresponding path program 1 times [2022-12-14 05:13:01,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:01,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765129572] [2022-12-14 05:13:01,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:01,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:02,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765129572] [2022-12-14 05:13:02,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765129572] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:02,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829805451] [2022-12-14 05:13:02,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:02,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:02,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:02,191 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:02,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 05:13:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:02,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 05:13:02,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:02,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:02,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:02,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:02,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:02,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:02,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:02,477 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-12-14 05:13:02,513 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int)) (v_ArrVal_478 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-12-14 05:13:02,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:02,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:13:02,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:02,527 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 159 treesize of output 149 [2022-12-14 05:13:02,532 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 67 treesize of output 59 [2022-12-14 05:13:02,537 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 126 treesize of output 110 [2022-12-14 05:13:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 05:13:02,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829805451] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:02,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [710377890] [2022-12-14 05:13:02,610 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-12-14 05:13:02,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:02,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 05:13:02,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628698712] [2022-12-14 05:13:02,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:02,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 05:13:02,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:02,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 05:13:02,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=356, Unknown=6, NotChecked=78, Total=506 [2022-12-14 05:13:02,612 INFO L87 Difference]: Start difference. First operand 581 states and 1917 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 05:13:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:03,616 INFO L93 Difference]: Finished difference Result 1019 states and 3024 transitions. [2022-12-14 05:13:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 05:13:03,616 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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 10 [2022-12-14 05:13:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:03,619 INFO L225 Difference]: With dead ends: 1019 [2022-12-14 05:13:03,619 INFO L226 Difference]: Without dead ends: 1019 [2022-12-14 05:13:03,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=867, Unknown=6, NotChecked=126, Total=1190 [2022-12-14 05:13:03,620 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 382 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:03,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 78 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1255 Invalid, 0 Unknown, 267 Unchecked, 0.5s Time] [2022-12-14 05:13:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2022-12-14 05:13:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 703. [2022-12-14 05:13:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 655 states have (on average 3.700763358778626) internal successors, (2424), 702 states have internal predecessors, (2424), 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-12-14 05:13:03,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 2424 transitions. [2022-12-14 05:13:03,631 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 2424 transitions. Word has length 10 [2022-12-14 05:13:03,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:03,631 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 2424 transitions. [2022-12-14 05:13:03,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 05:13:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 2424 transitions. [2022-12-14 05:13:03,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 05:13:03,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:03,632 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:03,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 05:13:03,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:03,833 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:03,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:03,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1741656482, now seen corresponding path program 1 times [2022-12-14 05:13:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:03,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307594746] [2022-12-14 05:13:03,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:03,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:04,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:04,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307594746] [2022-12-14 05:13:04,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307594746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:04,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040559050] [2022-12-14 05:13:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:04,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:04,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:04,110 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:04,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 05:13:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:04,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 05:13:04,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:04,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:04,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:04,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:04,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:04,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:04,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:04,343 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_517) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967296)) is different from false [2022-12-14 05:13:04,407 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_517 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 05:13:04,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:04,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:13:04,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:04,419 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 71 treesize of output 67 [2022-12-14 05:13:04,423 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 28 treesize of output 24 [2022-12-14 05:13:04,425 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 50 treesize of output 42 [2022-12-14 05:13:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 05:13:04,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040559050] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:04,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1435014158] [2022-12-14 05:13:04,485 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-12-14 05:13:04,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:04,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 05:13:04,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899698828] [2022-12-14 05:13:04,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:04,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 05:13:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 05:13:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=359, Unknown=6, NotChecked=78, Total=506 [2022-12-14 05:13:04,487 INFO L87 Difference]: Start difference. First operand 703 states and 2424 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 05:13:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:05,369 INFO L93 Difference]: Finished difference Result 992 states and 2906 transitions. [2022-12-14 05:13:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 05:13:05,369 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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 10 [2022-12-14 05:13:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:05,372 INFO L225 Difference]: With dead ends: 992 [2022-12-14 05:13:05,372 INFO L226 Difference]: Without dead ends: 992 [2022-12-14 05:13:05,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=817, Unknown=6, NotChecked=122, Total=1122 [2022-12-14 05:13:05,373 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 317 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:05,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 82 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1253 Invalid, 0 Unknown, 298 Unchecked, 0.5s Time] [2022-12-14 05:13:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-12-14 05:13:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 703. [2022-12-14 05:13:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 655 states have (on average 3.593893129770992) internal successors, (2354), 702 states have internal predecessors, (2354), 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-12-14 05:13:05,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 2354 transitions. [2022-12-14 05:13:05,385 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 2354 transitions. Word has length 10 [2022-12-14 05:13:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:05,385 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 2354 transitions. [2022-12-14 05:13:05,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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-12-14 05:13:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 2354 transitions. [2022-12-14 05:13:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 05:13:05,386 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:05,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:05,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 05:13:05,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:05,588 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:05,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:05,589 INFO L85 PathProgramCache]: Analyzing trace with hash 702383919, now seen corresponding path program 1 times [2022-12-14 05:13:05,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:05,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170667606] [2022-12-14 05:13:05,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:05,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:05,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:05,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170667606] [2022-12-14 05:13:05,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170667606] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:05,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623080110] [2022-12-14 05:13:05,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:05,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:05,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:05,662 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:05,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 05:13:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:05,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 05:13:05,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:05,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:05,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623080110] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:05,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1072277288] [2022-12-14 05:13:05,830 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-12-14 05:13:05,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:05,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-14 05:13:05,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284507298] [2022-12-14 05:13:05,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:05,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 05:13:05,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:05,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 05:13:05,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-12-14 05:13:05,832 INFO L87 Difference]: Start difference. First operand 703 states and 2354 transitions. Second operand has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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-12-14 05:13:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:05,990 INFO L93 Difference]: Finished difference Result 677 states and 2199 transitions. [2022-12-14 05:13:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 05:13:05,990 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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 10 [2022-12-14 05:13:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:05,994 INFO L225 Difference]: With dead ends: 677 [2022-12-14 05:13:05,994 INFO L226 Difference]: Without dead ends: 633 [2022-12-14 05:13:05,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-12-14 05:13:05,995 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 88 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:05,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 30 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:13:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-12-14 05:13:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 629. [2022-12-14 05:13:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 581 states have (on average 3.6161790017211706) internal successors, (2101), 628 states have internal predecessors, (2101), 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-12-14 05:13:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 2101 transitions. [2022-12-14 05:13:06,011 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 2101 transitions. Word has length 10 [2022-12-14 05:13:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:06,011 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 2101 transitions. [2022-12-14 05:13:06,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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-12-14 05:13:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 2101 transitions. [2022-12-14 05:13:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 05:13:06,012 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:06,012 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-12-14 05:13:06,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 05:13:06,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:06,212 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:06,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1843137184, now seen corresponding path program 2 times [2022-12-14 05:13:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:06,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734588678] [2022-12-14 05:13:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:06,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:06,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734588678] [2022-12-14 05:13:06,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734588678] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:06,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430137243] [2022-12-14 05:13:06,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:13:06,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:06,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:06,305 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:06,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 05:13:06,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 05:13:06,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:06,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 05:13:06,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:06,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:06,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430137243] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:06,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [827586070] [2022-12-14 05:13:06,542 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-12-14 05:13:06,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:06,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-14 05:13:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254566555] [2022-12-14 05:13:06,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:06,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 05:13:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:06,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 05:13:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-12-14 05:13:06,544 INFO L87 Difference]: Start difference. First operand 629 states and 2101 transitions. Second operand has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 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-12-14 05:13:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:06,848 INFO L93 Difference]: Finished difference Result 1023 states and 2762 transitions. [2022-12-14 05:13:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 05:13:06,849 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 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 11 [2022-12-14 05:13:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:06,853 INFO L225 Difference]: With dead ends: 1023 [2022-12-14 05:13:06,853 INFO L226 Difference]: Without dead ends: 997 [2022-12-14 05:13:06,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2022-12-14 05:13:06,854 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 247 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:06,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 39 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:13:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2022-12-14 05:13:06,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 637. [2022-12-14 05:13:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 589 states have (on average 3.235993208828523) internal successors, (1906), 636 states have internal predecessors, (1906), 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-12-14 05:13:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1906 transitions. [2022-12-14 05:13:06,864 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1906 transitions. Word has length 11 [2022-12-14 05:13:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:06,864 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 1906 transitions. [2022-12-14 05:13:06,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 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-12-14 05:13:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1906 transitions. [2022-12-14 05:13:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 05:13:06,865 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:06,865 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:06,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 05:13:07,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:07,066 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:07,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:07,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1914679207, now seen corresponding path program 2 times [2022-12-14 05:13:07,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:07,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182975573] [2022-12-14 05:13:07,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:07,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:13:07,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:07,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182975573] [2022-12-14 05:13:07,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182975573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:13:07,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:13:07,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:13:07,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353009566] [2022-12-14 05:13:07,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:13:07,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:13:07,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:07,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:13:07,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:13:07,139 INFO L87 Difference]: Start difference. First operand 637 states and 1906 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:07,224 INFO L93 Difference]: Finished difference Result 733 states and 1923 transitions. [2022-12-14 05:13:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:13:07,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 05:13:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:07,228 INFO L225 Difference]: With dead ends: 733 [2022-12-14 05:13:07,228 INFO L226 Difference]: Without dead ends: 733 [2022-12-14 05:13:07,228 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-12-14 05:13:07,228 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 51 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:07,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 6 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:13:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-12-14 05:13:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 567. [2022-12-14 05:13:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 532 states have (on average 3.101503759398496) internal successors, (1650), 566 states have internal predecessors, (1650), 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-12-14 05:13:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 1650 transitions. [2022-12-14 05:13:07,242 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 1650 transitions. Word has length 11 [2022-12-14 05:13:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:07,242 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 1650 transitions. [2022-12-14 05:13:07,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 1650 transitions. [2022-12-14 05:13:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 05:13:07,243 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:07,243 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:07,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 05:13:07,243 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:07,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:07,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1914679206, now seen corresponding path program 1 times [2022-12-14 05:13:07,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:07,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136282468] [2022-12-14 05:13:07,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:07,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:13:07,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:07,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136282468] [2022-12-14 05:13:07,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136282468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:13:07,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:13:07,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:13:07,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923643759] [2022-12-14 05:13:07,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:13:07,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:13:07,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:07,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:13:07,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:13:07,290 INFO L87 Difference]: Start difference. First operand 567 states and 1650 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:07,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:07,363 INFO L93 Difference]: Finished difference Result 649 states and 1661 transitions. [2022-12-14 05:13:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:13:07,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 05:13:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:07,366 INFO L225 Difference]: With dead ends: 649 [2022-12-14 05:13:07,366 INFO L226 Difference]: Without dead ends: 624 [2022-12-14 05:13:07,366 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-12-14 05:13:07,366 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 47 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:07,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 6 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:13:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-12-14 05:13:07,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 416. [2022-12-14 05:13:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 392 states have (on average 2.8239795918367347) internal successors, (1107), 415 states have internal predecessors, (1107), 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-12-14 05:13:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1107 transitions. [2022-12-14 05:13:07,376 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1107 transitions. Word has length 11 [2022-12-14 05:13:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:07,377 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 1107 transitions. [2022-12-14 05:13:07,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1107 transitions. [2022-12-14 05:13:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 05:13:07,377 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:07,382 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:07,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 05:13:07,383 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:07,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1914679210, now seen corresponding path program 1 times [2022-12-14 05:13:07,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:07,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913034155] [2022-12-14 05:13:07,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:07,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:07,628 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:07,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913034155] [2022-12-14 05:13:07,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913034155] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:07,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785662952] [2022-12-14 05:13:07,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:07,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:07,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:07,630 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:07,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 05:13:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:07,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 05:13:07,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:07,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:07,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:07,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:07,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:07,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:07,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:07,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_649 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_649) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456)) is different from false [2022-12-14 05:13:07,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:07,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:13:07,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:07,930 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 71 treesize of output 67 [2022-12-14 05:13:07,932 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 54 treesize of output 46 [2022-12-14 05:13:07,935 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 24 treesize of output 20 [2022-12-14 05:13:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:07,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785662952] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:07,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1754901205] [2022-12-14 05:13:07,997 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-12-14 05:13:07,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:07,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 05:13:07,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566541414] [2022-12-14 05:13:07,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:07,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 05:13:07,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:07,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 05:13:07,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=394, Unknown=2, NotChecked=40, Total=506 [2022-12-14 05:13:07,999 INFO L87 Difference]: Start difference. First operand 416 states and 1107 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 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-12-14 05:13:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:08,517 INFO L93 Difference]: Finished difference Result 574 states and 1501 transitions. [2022-12-14 05:13:08,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 05:13:08,518 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 05:13:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:08,520 INFO L225 Difference]: With dead ends: 574 [2022-12-14 05:13:08,520 INFO L226 Difference]: Without dead ends: 574 [2022-12-14 05:13:08,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=758, Unknown=2, NotChecked=58, Total=992 [2022-12-14 05:13:08,521 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 185 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:08,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 34 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 453 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2022-12-14 05:13:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-12-14 05:13:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 492. [2022-12-14 05:13:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 468 states have (on average 2.9294871794871793) internal successors, (1371), 491 states have internal predecessors, (1371), 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-12-14 05:13:08,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1371 transitions. [2022-12-14 05:13:08,527 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1371 transitions. Word has length 11 [2022-12-14 05:13:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:08,527 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 1371 transitions. [2022-12-14 05:13:08,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 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-12-14 05:13:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1371 transitions. [2022-12-14 05:13:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 05:13:08,527 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:08,527 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:08,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 05:13:08,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 05:13:08,729 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:08,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:08,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1914679209, now seen corresponding path program 1 times [2022-12-14 05:13:08,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:08,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542681570] [2022-12-14 05:13:08,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:08,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:08,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542681570] [2022-12-14 05:13:08,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542681570] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:08,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319998274] [2022-12-14 05:13:08,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:08,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:08,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:08,985 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:08,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 05:13:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:09,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 05:13:09,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:09,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:09,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:09,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:09,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:09,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:09,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:09,245 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296))) is different from false [2022-12-14 05:13:09,253 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_686) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_687) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-12-14 05:13:09,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:09,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:13:09,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:09,268 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 159 treesize of output 149 [2022-12-14 05:13:09,272 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 134 treesize of output 126 [2022-12-14 05:13:09,275 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 126 treesize of output 110 [2022-12-14 05:13:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 05:13:09,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319998274] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:09,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2036629392] [2022-12-14 05:13:09,357 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-12-14 05:13:09,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:09,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 05:13:09,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606343388] [2022-12-14 05:13:09,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:09,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 05:13:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:09,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 05:13:09,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=355, Unknown=2, NotChecked=78, Total=506 [2022-12-14 05:13:09,359 INFO L87 Difference]: Start difference. First operand 492 states and 1371 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 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-12-14 05:13:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:09,794 INFO L93 Difference]: Finished difference Result 536 states and 1399 transitions. [2022-12-14 05:13:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 05:13:09,795 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 05:13:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:09,796 INFO L225 Difference]: With dead ends: 536 [2022-12-14 05:13:09,796 INFO L226 Difference]: Without dead ends: 536 [2022-12-14 05:13:09,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=665, Unknown=2, NotChecked=110, Total=930 [2022-12-14 05:13:09,797 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 203 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:09,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 24 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 326 Invalid, 0 Unknown, 127 Unchecked, 0.2s Time] [2022-12-14 05:13:09,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-12-14 05:13:09,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 492. [2022-12-14 05:13:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 468 states have (on average 2.8482905982905984) internal successors, (1333), 491 states have internal predecessors, (1333), 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-12-14 05:13:09,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 1333 transitions. [2022-12-14 05:13:09,803 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 1333 transitions. Word has length 11 [2022-12-14 05:13:09,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:09,803 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 1333 transitions. [2022-12-14 05:13:09,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 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-12-14 05:13:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 1333 transitions. [2022-12-14 05:13:09,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 05:13:09,804 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:09,804 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2022-12-14 05:13:09,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 05:13:10,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 05:13:10,005 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:10,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:10,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1976408394, now seen corresponding path program 3 times [2022-12-14 05:13:10,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:10,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708597190] [2022-12-14 05:13:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:10,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:10,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:10,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708597190] [2022-12-14 05:13:10,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708597190] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:10,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151108381] [2022-12-14 05:13:10,231 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:13:10,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:10,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:10,232 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:10,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 05:13:10,340 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:13:10,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:10,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 05:13:10,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:10,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:10,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:10,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:10,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:10,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:10,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-14 05:13:10,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:10,574 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 37 treesize of output 33 [2022-12-14 05:13:10,582 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 7 treesize of output 3 [2022-12-14 05:13:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:10,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151108381] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:10,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1305741199] [2022-12-14 05:13:10,617 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-12-14 05:13:10,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:10,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-14 05:13:10,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058295437] [2022-12-14 05:13:10,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:10,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 05:13:10,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:10,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 05:13:10,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=477, Unknown=4, NotChecked=0, Total=552 [2022-12-14 05:13:10,618 INFO L87 Difference]: Start difference. First operand 492 states and 1333 transitions. Second operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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-12-14 05:13:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:10,992 INFO L93 Difference]: Finished difference Result 742 states and 1912 transitions. [2022-12-14 05:13:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 05:13:10,993 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 05:13:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:10,996 INFO L225 Difference]: With dead ends: 742 [2022-12-14 05:13:10,996 INFO L226 Difference]: Without dead ends: 742 [2022-12-14 05:13:10,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=887, Unknown=4, NotChecked=0, Total=1056 [2022-12-14 05:13:10,996 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 125 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:10,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 40 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:13:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-12-14 05:13:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 496. [2022-12-14 05:13:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 472 states have (on average 2.847457627118644) internal successors, (1344), 495 states have internal predecessors, (1344), 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-12-14 05:13:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1344 transitions. [2022-12-14 05:13:11,004 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 1344 transitions. Word has length 12 [2022-12-14 05:13:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:11,004 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 1344 transitions. [2022-12-14 05:13:11,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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-12-14 05:13:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1344 transitions. [2022-12-14 05:13:11,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 05:13:11,004 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:11,004 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1] [2022-12-14 05:13:11,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-14 05:13:11,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:11,205 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:11,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash -123237025, now seen corresponding path program 3 times [2022-12-14 05:13:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:11,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064384216] [2022-12-14 05:13:11,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:11,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:11,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:11,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064384216] [2022-12-14 05:13:11,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064384216] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:11,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201790293] [2022-12-14 05:13:11,440 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:13:11,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:11,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:11,441 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:11,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 05:13:11,542 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:13:11,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:11,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 05:13:11,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:11,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:11,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:11,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-14 05:13:11,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:11,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:11,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:11,739 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-12-14 05:13:11,795 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 05:13:11,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2022-12-14 05:13:11,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:11,800 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 43 treesize of output 39 [2022-12-14 05:13:11,809 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 9 treesize of output 5 [2022-12-14 05:13:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-14 05:13:11,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201790293] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:11,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2101201271] [2022-12-14 05:13:11,855 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-12-14 05:13:11,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:11,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-12-14 05:13:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751264913] [2022-12-14 05:13:11,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:11,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 05:13:11,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:11,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 05:13:11,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=564, Unknown=9, NotChecked=48, Total=702 [2022-12-14 05:13:11,857 INFO L87 Difference]: Start difference. First operand 496 states and 1344 transitions. Second operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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-12-14 05:13:12,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:12,317 INFO L93 Difference]: Finished difference Result 741 states and 1910 transitions. [2022-12-14 05:13:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 05:13:12,318 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 05:13:12,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:12,322 INFO L225 Difference]: With dead ends: 741 [2022-12-14 05:13:12,322 INFO L226 Difference]: Without dead ends: 741 [2022-12-14 05:13:12,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=994, Unknown=9, NotChecked=66, Total=1260 [2022-12-14 05:13:12,323 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 132 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:12,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 53 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 876 Invalid, 0 Unknown, 85 Unchecked, 0.3s Time] [2022-12-14 05:13:12,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-12-14 05:13:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 496. [2022-12-14 05:13:12,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 472 states have (on average 2.8453389830508473) internal successors, (1343), 495 states have internal predecessors, (1343), 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-12-14 05:13:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 1343 transitions. [2022-12-14 05:13:12,330 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 1343 transitions. Word has length 13 [2022-12-14 05:13:12,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:12,330 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 1343 transitions. [2022-12-14 05:13:12,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 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-12-14 05:13:12,330 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 1343 transitions. [2022-12-14 05:13:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 05:13:12,331 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:12,331 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:12,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 05:13:12,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 05:13:12,532 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:12,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:12,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1139114397, now seen corresponding path program 2 times [2022-12-14 05:13:12,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:12,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524843854] [2022-12-14 05:13:12,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:12,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:12,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:12,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524843854] [2022-12-14 05:13:12,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524843854] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:12,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177426148] [2022-12-14 05:13:12,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:13:12,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:12,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:12,826 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:12,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 05:13:12,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 05:13:12,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:12,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 05:13:12,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:13,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:13,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:13,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:13,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:13,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:13,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:13,209 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_809) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-12-14 05:13:13,214 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_809) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-12-14 05:13:13,221 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_809) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-12-14 05:13:13,227 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_809 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_809) c_~A~0.base) (+ c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-12-14 05:13:13,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:13,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:13:13,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:13,274 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 81 treesize of output 77 [2022-12-14 05:13:13,277 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 62 treesize of output 54 [2022-12-14 05:13:13,281 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 28 treesize of output 24 [2022-12-14 05:13:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-14 05:13:13,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177426148] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:13,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1252294050] [2022-12-14 05:13:13,355 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-12-14 05:13:13,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:13,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-12-14 05:13:13,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136495136] [2022-12-14 05:13:13,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:13,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 05:13:13,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:13,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 05:13:13,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=522, Unknown=8, NotChecked=196, Total=812 [2022-12-14 05:13:13,357 INFO L87 Difference]: Start difference. First operand 496 states and 1343 transitions. Second operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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-12-14 05:13:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:14,339 INFO L93 Difference]: Finished difference Result 801 states and 1994 transitions. [2022-12-14 05:13:14,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 05:13:14,340 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 05:13:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:14,341 INFO L225 Difference]: With dead ends: 801 [2022-12-14 05:13:14,341 INFO L226 Difference]: Without dead ends: 801 [2022-12-14 05:13:14,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=949, Unknown=8, NotChecked=268, Total=1406 [2022-12-14 05:13:14,342 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 291 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 464 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:14,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 114 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1379 Invalid, 0 Unknown, 464 Unchecked, 0.6s Time] [2022-12-14 05:13:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-12-14 05:13:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 546. [2022-12-14 05:13:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 522 states have (on average 2.917624521072797) internal successors, (1523), 545 states have internal predecessors, (1523), 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-12-14 05:13:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1523 transitions. [2022-12-14 05:13:14,349 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1523 transitions. Word has length 13 [2022-12-14 05:13:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:14,349 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 1523 transitions. [2022-12-14 05:13:14,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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-12-14 05:13:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1523 transitions. [2022-12-14 05:13:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 05:13:14,350 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:14,350 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:14,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 05:13:14,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 05:13:14,551 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:14,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1139114396, now seen corresponding path program 2 times [2022-12-14 05:13:14,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:14,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235225835] [2022-12-14 05:13:14,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:14,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:14,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:14,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235225835] [2022-12-14 05:13:14,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235225835] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:14,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667721843] [2022-12-14 05:13:14,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:13:14,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:14,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:14,862 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:14,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 05:13:14,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 05:13:14,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:14,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 05:13:14,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:15,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:15,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:15,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:15,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:15,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:15,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:15,216 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_851 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_851) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967296)) is different from false [2022-12-14 05:13:15,248 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_851 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_851) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 4294967296)) is different from false [2022-12-14 05:13:15,254 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_851 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_851) c_~A~0.base) (+ c_~A~0.offset 8)) 4294967296)) is different from false [2022-12-14 05:13:15,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:15,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:13:15,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:15,308 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 71 treesize of output 67 [2022-12-14 05:13:15,311 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 54 treesize of output 46 [2022-12-14 05:13:15,313 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 24 treesize of output 20 [2022-12-14 05:13:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 05:13:15,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667721843] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:15,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [381154607] [2022-12-14 05:13:15,379 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-12-14 05:13:15,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:15,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-12-14 05:13:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138983475] [2022-12-14 05:13:15,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:15,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 05:13:15,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 05:13:15,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=566, Unknown=8, NotChecked=150, Total=812 [2022-12-14 05:13:15,381 INFO L87 Difference]: Start difference. First operand 546 states and 1523 transitions. Second operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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-12-14 05:13:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:16,040 INFO L93 Difference]: Finished difference Result 776 states and 1928 transitions. [2022-12-14 05:13:16,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 05:13:16,041 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 05:13:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:16,042 INFO L225 Difference]: With dead ends: 776 [2022-12-14 05:13:16,042 INFO L226 Difference]: Without dead ends: 776 [2022-12-14 05:13:16,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=1009, Unknown=8, NotChecked=204, Total=1406 [2022-12-14 05:13:16,043 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 355 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:16,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 87 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1092 Invalid, 0 Unknown, 329 Unchecked, 0.4s Time] [2022-12-14 05:13:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-12-14 05:13:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 546. [2022-12-14 05:13:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 522 states have (on average 2.8697318007662833) internal successors, (1498), 545 states have internal predecessors, (1498), 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-12-14 05:13:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1498 transitions. [2022-12-14 05:13:16,050 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1498 transitions. Word has length 13 [2022-12-14 05:13:16,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:16,050 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 1498 transitions. [2022-12-14 05:13:16,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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-12-14 05:13:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1498 transitions. [2022-12-14 05:13:16,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 05:13:16,051 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:16,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:16,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-14 05:13:16,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:16,252 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:16,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1760690250, now seen corresponding path program 2 times [2022-12-14 05:13:16,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:16,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163137461] [2022-12-14 05:13:16,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:16,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:16,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:16,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163137461] [2022-12-14 05:13:16,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163137461] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:16,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954417514] [2022-12-14 05:13:16,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:13:16,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:16,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:16,345 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:16,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 05:13:16,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 05:13:16,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:16,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 05:13:16,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:16,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:16,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:16,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954417514] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:16,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1520748104] [2022-12-14 05:13:16,616 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-12-14 05:13:16,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:16,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-14 05:13:16,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662202237] [2022-12-14 05:13:16,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:16,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 05:13:16,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:16,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 05:13:16,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-12-14 05:13:16,618 INFO L87 Difference]: Start difference. First operand 546 states and 1498 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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-12-14 05:13:16,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:16,793 INFO L93 Difference]: Finished difference Result 512 states and 1356 transitions. [2022-12-14 05:13:16,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 05:13:16,794 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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 13 [2022-12-14 05:13:16,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:16,795 INFO L225 Difference]: With dead ends: 512 [2022-12-14 05:13:16,795 INFO L226 Difference]: Without dead ends: 401 [2022-12-14 05:13:16,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2022-12-14 05:13:16,796 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 93 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:16,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 34 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:13:16,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-12-14 05:13:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2022-12-14 05:13:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 377 states have (on average 2.9018567639257293) internal successors, (1094), 400 states have internal predecessors, (1094), 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-12-14 05:13:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1094 transitions. [2022-12-14 05:13:16,803 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 1094 transitions. Word has length 13 [2022-12-14 05:13:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:16,804 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 1094 transitions. [2022-12-14 05:13:16,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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-12-14 05:13:16,804 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 1094 transitions. [2022-12-14 05:13:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 05:13:16,804 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:16,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2022-12-14 05:13:16,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 05:13:17,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:17,005 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:17,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:17,005 INFO L85 PathProgramCache]: Analyzing trace with hash -952894630, now seen corresponding path program 4 times [2022-12-14 05:13:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:17,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787173480] [2022-12-14 05:13:17,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:17,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:17,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:17,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787173480] [2022-12-14 05:13:17,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787173480] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:17,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144515016] [2022-12-14 05:13:17,111 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:13:17,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:17,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:17,112 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:17,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 05:13:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:17,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 05:13:17,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:17,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:17,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144515016] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:17,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [586435912] [2022-12-14 05:13:17,400 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-12-14 05:13:17,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:17,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-12-14 05:13:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350519469] [2022-12-14 05:13:17,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:17,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 05:13:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:17,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 05:13:17,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-12-14 05:13:17,402 INFO L87 Difference]: Start difference. First operand 401 states and 1094 transitions. Second operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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-12-14 05:13:17,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:17,771 INFO L93 Difference]: Finished difference Result 784 states and 1999 transitions. [2022-12-14 05:13:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 05:13:17,771 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 05:13:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:17,772 INFO L225 Difference]: With dead ends: 784 [2022-12-14 05:13:17,773 INFO L226 Difference]: Without dead ends: 768 [2022-12-14 05:13:17,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=278, Invalid=714, Unknown=0, NotChecked=0, Total=992 [2022-12-14 05:13:17,773 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 182 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:17,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 65 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:13:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-12-14 05:13:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 584. [2022-12-14 05:13:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 560 states have (on average 2.880357142857143) internal successors, (1613), 583 states have internal predecessors, (1613), 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-12-14 05:13:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1613 transitions. [2022-12-14 05:13:17,781 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1613 transitions. Word has length 14 [2022-12-14 05:13:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:17,781 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 1613 transitions. [2022-12-14 05:13:17,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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-12-14 05:13:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1613 transitions. [2022-12-14 05:13:17,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 05:13:17,781 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:17,781 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:17,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 05:13:17,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-14 05:13:17,983 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:17,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:17,984 INFO L85 PathProgramCache]: Analyzing trace with hash -146952628, now seen corresponding path program 3 times [2022-12-14 05:13:17,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:17,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388679382] [2022-12-14 05:13:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:17,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:18,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:18,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388679382] [2022-12-14 05:13:18,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388679382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:18,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267240244] [2022-12-14 05:13:18,224 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:13:18,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:18,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:18,225 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:18,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 05:13:18,342 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:13:18,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:18,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 05:13:18,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:18,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:18,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:18,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:18,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:18,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:18,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:18,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:18,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:13:18,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:18,604 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 71 treesize of output 67 [2022-12-14 05:13:18,608 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 28 treesize of output 24 [2022-12-14 05:13:18,611 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 50 treesize of output 42 [2022-12-14 05:13:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:18,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267240244] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:18,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1875066240] [2022-12-14 05:13:18,694 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-12-14 05:13:18,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:18,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-12-14 05:13:18,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154534669] [2022-12-14 05:13:18,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:18,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 05:13:18,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:18,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 05:13:18,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=605, Unknown=13, NotChecked=0, Total=702 [2022-12-14 05:13:18,696 INFO L87 Difference]: Start difference. First operand 584 states and 1613 transitions. Second operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 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-12-14 05:13:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:19,405 INFO L93 Difference]: Finished difference Result 800 states and 2134 transitions. [2022-12-14 05:13:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 05:13:19,405 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 05:13:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:19,407 INFO L225 Difference]: With dead ends: 800 [2022-12-14 05:13:19,407 INFO L226 Difference]: Without dead ends: 800 [2022-12-14 05:13:19,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=981, Unknown=13, NotChecked=0, Total=1190 [2022-12-14 05:13:19,408 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 322 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:19,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 71 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 05:13:19,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-12-14 05:13:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 676. [2022-12-14 05:13:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 652 states have (on average 2.9708588957055215) internal successors, (1937), 675 states have internal predecessors, (1937), 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-12-14 05:13:19,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1937 transitions. [2022-12-14 05:13:19,416 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1937 transitions. Word has length 14 [2022-12-14 05:13:19,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:19,416 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 1937 transitions. [2022-12-14 05:13:19,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 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-12-14 05:13:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1937 transitions. [2022-12-14 05:13:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 05:13:19,417 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:19,417 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:19,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-14 05:13:19,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-14 05:13:19,618 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:19,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:19,620 INFO L85 PathProgramCache]: Analyzing trace with hash -146952627, now seen corresponding path program 2 times [2022-12-14 05:13:19,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:19,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881837032] [2022-12-14 05:13:19,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:19,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:19,875 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:19,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881837032] [2022-12-14 05:13:19,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881837032] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:19,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061122817] [2022-12-14 05:13:19,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:13:19,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:19,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:19,876 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:19,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 05:13:19,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 05:13:19,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:19,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 05:13:20,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:20,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:20,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:20,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:20,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:20,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:20,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:20,217 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1003) c_~A~0.base) (+ c_~A~0.offset 8)) 4294967296))) is different from false [2022-12-14 05:13:20,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:20,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:13:20,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:20,258 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 159 treesize of output 149 [2022-12-14 05:13:20,261 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 134 treesize of output 118 [2022-12-14 05:13:20,263 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 118 treesize of output 110 [2022-12-14 05:13:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:20,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061122817] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:20,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [440522893] [2022-12-14 05:13:20,338 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-12-14 05:13:20,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:20,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-12-14 05:13:20,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555328658] [2022-12-14 05:13:20,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:20,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 05:13:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:20,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 05:13:20,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=4, NotChecked=48, Total=702 [2022-12-14 05:13:20,340 INFO L87 Difference]: Start difference. First operand 676 states and 1937 transitions. Second operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 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-12-14 05:13:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:21,023 INFO L93 Difference]: Finished difference Result 754 states and 2008 transitions. [2022-12-14 05:13:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 05:13:21,023 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 05:13:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:21,024 INFO L225 Difference]: With dead ends: 754 [2022-12-14 05:13:21,025 INFO L226 Difference]: Without dead ends: 754 [2022-12-14 05:13:21,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=4, NotChecked=64, Total=1190 [2022-12-14 05:13:21,025 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 204 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:21,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 83 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1054 Invalid, 0 Unknown, 87 Unchecked, 0.5s Time] [2022-12-14 05:13:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-12-14 05:13:21,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 676. [2022-12-14 05:13:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 652 states have (on average 2.9003067484662575) internal successors, (1891), 675 states have internal predecessors, (1891), 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-12-14 05:13:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1891 transitions. [2022-12-14 05:13:21,033 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1891 transitions. Word has length 14 [2022-12-14 05:13:21,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:21,033 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 1891 transitions. [2022-12-14 05:13:21,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 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-12-14 05:13:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1891 transitions. [2022-12-14 05:13:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 05:13:21,033 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:21,033 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-12-14 05:13:21,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 05:13:21,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:21,234 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:21,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:21,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1828331395, now seen corresponding path program 4 times [2022-12-14 05:13:21,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:21,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920413279] [2022-12-14 05:13:21,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:21,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:21,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:21,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920413279] [2022-12-14 05:13:21,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920413279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:21,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385158364] [2022-12-14 05:13:21,451 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:13:21,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:21,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:21,452 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:21,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 05:13:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:21,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 05:13:21,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:21,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:21,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:21,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:21,741 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:21,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:21,845 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1044 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-12-14 05:13:21,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:21,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 05:13:21,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:21,856 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 43 treesize of output 39 [2022-12-14 05:13:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-14 05:13:21,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385158364] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:21,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [656232894] [2022-12-14 05:13:21,949 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-12-14 05:13:21,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:21,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 05:13:21,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367569247] [2022-12-14 05:13:21,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:21,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 05:13:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:21,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 05:13:21,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=840, Unknown=1, NotChecked=58, Total=992 [2022-12-14 05:13:21,950 INFO L87 Difference]: Start difference. First operand 676 states and 1891 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 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-12-14 05:13:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:22,910 INFO L93 Difference]: Finished difference Result 1021 states and 2713 transitions. [2022-12-14 05:13:22,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 05:13:22,911 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 05:13:22,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:22,913 INFO L225 Difference]: With dead ends: 1021 [2022-12-14 05:13:22,913 INFO L226 Difference]: Without dead ends: 1021 [2022-12-14 05:13:22,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=249, Invalid=1916, Unknown=1, NotChecked=90, Total=2256 [2022-12-14 05:13:22,915 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 158 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:22,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 75 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1267 Invalid, 0 Unknown, 72 Unchecked, 0.5s Time] [2022-12-14 05:13:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-12-14 05:13:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 678. [2022-12-14 05:13:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 654 states have (on average 2.900611620795107) internal successors, (1897), 677 states have internal predecessors, (1897), 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-12-14 05:13:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1897 transitions. [2022-12-14 05:13:22,924 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1897 transitions. Word has length 15 [2022-12-14 05:13:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:22,925 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 1897 transitions. [2022-12-14 05:13:22,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 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-12-14 05:13:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1897 transitions. [2022-12-14 05:13:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 05:13:22,925 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:22,925 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-12-14 05:13:22,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 05:13:23,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-14 05:13:23,126 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:23,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:23,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1828331396, now seen corresponding path program 5 times [2022-12-14 05:13:23,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:23,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310676186] [2022-12-14 05:13:23,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:23,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:23,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:23,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310676186] [2022-12-14 05:13:23,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310676186] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:23,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491872921] [2022-12-14 05:13:23,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:13:23,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:23,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:23,402 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:23,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 05:13:23,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 05:13:23,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:23,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 05:13:23,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:23,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:23,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:23,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:23,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:23,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:23,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-14 05:13:23,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:23,857 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 37 treesize of output 33 [2022-12-14 05:13:23,859 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 7 treesize of output 3 [2022-12-14 05:13:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:23,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491872921] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:23,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1951258362] [2022-12-14 05:13:23,922 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-12-14 05:13:23,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:23,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2022-12-14 05:13:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205623271] [2022-12-14 05:13:23,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:23,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 05:13:23,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:23,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 05:13:23,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=776, Unknown=3, NotChecked=0, Total=870 [2022-12-14 05:13:23,926 INFO L87 Difference]: Start difference. First operand 678 states and 1897 transitions. Second operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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-12-14 05:13:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:24,443 INFO L93 Difference]: Finished difference Result 1020 states and 2711 transitions. [2022-12-14 05:13:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 05:13:24,444 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 05:13:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:24,445 INFO L225 Difference]: With dead ends: 1020 [2022-12-14 05:13:24,445 INFO L226 Difference]: Without dead ends: 1020 [2022-12-14 05:13:24,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=1427, Unknown=3, NotChecked=0, Total=1640 [2022-12-14 05:13:24,446 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 130 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:24,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 46 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:13:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2022-12-14 05:13:24,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 678. [2022-12-14 05:13:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 654 states have (on average 2.8990825688073394) internal successors, (1896), 677 states have internal predecessors, (1896), 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-12-14 05:13:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1896 transitions. [2022-12-14 05:13:24,457 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1896 transitions. Word has length 15 [2022-12-14 05:13:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:24,457 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 1896 transitions. [2022-12-14 05:13:24,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 states have internal predecessors, (42), 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-12-14 05:13:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1896 transitions. [2022-12-14 05:13:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 05:13:24,457 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:24,457 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:24,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-14 05:13:24,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-14 05:13:24,658 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:24,659 INFO L85 PathProgramCache]: Analyzing trace with hash 843702101, now seen corresponding path program 3 times [2022-12-14 05:13:24,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:24,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254897997] [2022-12-14 05:13:24,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:24,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:24,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:24,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254897997] [2022-12-14 05:13:24,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254897997] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:24,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15898996] [2022-12-14 05:13:24,989 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:13:24,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:24,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:24,990 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:24,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 05:13:25,110 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:13:25,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:25,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 05:13:25,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:25,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:25,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:25,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:25,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:25,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:25,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:25,415 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1131 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1131) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-12-14 05:13:25,529 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1131 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1131) c_~A~0.base) (+ c_~A~0.offset 12)) 9223372039002259456))) is different from false [2022-12-14 05:13:25,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:25,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:13:25,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:25,584 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 159 treesize of output 149 [2022-12-14 05:13:25,587 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 134 treesize of output 118 [2022-12-14 05:13:25,590 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 118 treesize of output 110 [2022-12-14 05:13:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:25,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15898996] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:25,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2023347024] [2022-12-14 05:13:25,702 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-12-14 05:13:25,702 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:25,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 05:13:25,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132436602] [2022-12-14 05:13:25,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:25,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 05:13:25,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:25,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 05:13:25,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=930, Unknown=24, NotChecked=126, Total=1190 [2022-12-14 05:13:25,704 INFO L87 Difference]: Start difference. First operand 678 states and 1896 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 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-12-14 05:13:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:26,824 INFO L93 Difference]: Finished difference Result 1116 states and 2823 transitions. [2022-12-14 05:13:26,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 05:13:26,824 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 05:13:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:26,826 INFO L225 Difference]: With dead ends: 1116 [2022-12-14 05:13:26,826 INFO L226 Difference]: Without dead ends: 1116 [2022-12-14 05:13:26,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=1642, Unknown=24, NotChecked=170, Total=2070 [2022-12-14 05:13:26,827 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 324 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:26,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 167 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2084 Invalid, 0 Unknown, 203 Unchecked, 0.8s Time] [2022-12-14 05:13:26,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-12-14 05:13:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 736. [2022-12-14 05:13:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 712 states have (on average 2.960674157303371) internal successors, (2108), 735 states have internal predecessors, (2108), 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-12-14 05:13:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 2108 transitions. [2022-12-14 05:13:26,837 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 2108 transitions. Word has length 16 [2022-12-14 05:13:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:26,837 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 2108 transitions. [2022-12-14 05:13:26,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 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-12-14 05:13:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 2108 transitions. [2022-12-14 05:13:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 05:13:26,838 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:26,838 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:26,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-14 05:13:27,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 05:13:27,039 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:27,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:27,040 INFO L85 PathProgramCache]: Analyzing trace with hash 843702102, now seen corresponding path program 3 times [2022-12-14 05:13:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:27,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860184931] [2022-12-14 05:13:27,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:27,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:27,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860184931] [2022-12-14 05:13:27,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860184931] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:27,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125981016] [2022-12-14 05:13:27,386 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:13:27,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:27,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:27,387 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:27,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 05:13:27,508 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:13:27,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:27,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 05:13:27,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:27,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:27,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:27,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:27,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:27,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:27,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:27,891 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1177) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 4294967296)) is different from false [2022-12-14 05:13:27,928 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1177) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 12)) 4294967296)) is different from false [2022-12-14 05:13:27,971 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1176) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 05:13:27,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:27,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:13:27,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:27,985 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 141 treesize of output 131 [2022-12-14 05:13:27,987 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 118 treesize of output 102 [2022-12-14 05:13:27,996 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 102 treesize of output 94 [2022-12-14 05:13:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-12-14 05:13:28,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125981016] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:28,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [826230123] [2022-12-14 05:13:28,124 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-12-14 05:13:28,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:28,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 05:13:28,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700158684] [2022-12-14 05:13:28,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:28,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 05:13:28,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:28,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 05:13:28,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=12, NotChecked=186, Total=1190 [2022-12-14 05:13:28,126 INFO L87 Difference]: Start difference. First operand 736 states and 2108 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 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-12-14 05:13:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:29,628 INFO L93 Difference]: Finished difference Result 1087 states and 2745 transitions. [2022-12-14 05:13:29,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 05:13:29,628 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 05:13:29,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:29,630 INFO L225 Difference]: With dead ends: 1087 [2022-12-14 05:13:29,630 INFO L226 Difference]: Without dead ends: 1087 [2022-12-14 05:13:29,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=1566, Unknown=12, NotChecked=252, Total=2070 [2022-12-14 05:13:29,631 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 343 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:29,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 171 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2060 Invalid, 0 Unknown, 512 Unchecked, 1.1s Time] [2022-12-14 05:13:29,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2022-12-14 05:13:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 736. [2022-12-14 05:13:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 712 states have (on average 2.919943820224719) internal successors, (2079), 735 states have internal predecessors, (2079), 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-12-14 05:13:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 2079 transitions. [2022-12-14 05:13:29,641 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 2079 transitions. Word has length 16 [2022-12-14 05:13:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:29,641 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 2079 transitions. [2022-12-14 05:13:29,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 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-12-14 05:13:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 2079 transitions. [2022-12-14 05:13:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 05:13:29,642 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:29,642 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:29,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-14 05:13:29,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 05:13:29,843 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:29,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash 512473132, now seen corresponding path program 4 times [2022-12-14 05:13:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:29,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860842423] [2022-12-14 05:13:29,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:29,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:29,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:29,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860842423] [2022-12-14 05:13:29,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860842423] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:29,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026772902] [2022-12-14 05:13:29,969 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:13:29,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:29,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:29,970 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:29,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 05:13:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:30,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 05:13:30,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:30,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:30,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026772902] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:30,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1267202430] [2022-12-14 05:13:30,209 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-12-14 05:13:30,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:30,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-12-14 05:13:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035314934] [2022-12-14 05:13:30,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:30,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 05:13:30,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:30,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 05:13:30,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-12-14 05:13:30,210 INFO L87 Difference]: Start difference. First operand 736 states and 2079 transitions. Second operand has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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-12-14 05:13:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:30,417 INFO L93 Difference]: Finished difference Result 690 states and 1887 transitions. [2022-12-14 05:13:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 05:13:30,417 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 05:13:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:30,418 INFO L225 Difference]: With dead ends: 690 [2022-12-14 05:13:30,418 INFO L226 Difference]: Without dead ends: 511 [2022-12-14 05:13:30,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2022-12-14 05:13:30,419 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 91 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:30,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 57 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:13:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-12-14 05:13:30,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2022-12-14 05:13:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 487 states have (on average 2.9589322381930185) internal successors, (1441), 510 states have internal predecessors, (1441), 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-12-14 05:13:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1441 transitions. [2022-12-14 05:13:30,425 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 1441 transitions. Word has length 16 [2022-12-14 05:13:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:30,425 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 1441 transitions. [2022-12-14 05:13:30,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 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-12-14 05:13:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 1441 transitions. [2022-12-14 05:13:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 05:13:30,426 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:30,426 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2022-12-14 05:13:30,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-14 05:13:30,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-14 05:13:30,627 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:30,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash 384874663, now seen corresponding path program 5 times [2022-12-14 05:13:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:30,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045863541] [2022-12-14 05:13:30,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:30,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:30,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:30,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045863541] [2022-12-14 05:13:30,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045863541] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:30,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930293527] [2022-12-14 05:13:30,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:13:30,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:30,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:30,769 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:30,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-14 05:13:30,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 05:13:30,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:30,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 05:13:30,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:31,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:31,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930293527] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:31,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [895845403] [2022-12-14 05:13:31,156 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-12-14 05:13:31,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:31,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-12-14 05:13:31,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915640959] [2022-12-14 05:13:31,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:31,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 05:13:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:31,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 05:13:31,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2022-12-14 05:13:31,158 INFO L87 Difference]: Start difference. First operand 511 states and 1441 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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-12-14 05:13:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:31,718 INFO L93 Difference]: Finished difference Result 1083 states and 2819 transitions. [2022-12-14 05:13:31,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 05:13:31,718 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 05:13:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:31,721 INFO L225 Difference]: With dead ends: 1083 [2022-12-14 05:13:31,721 INFO L226 Difference]: Without dead ends: 1063 [2022-12-14 05:13:31,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=402, Invalid=1080, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 05:13:31,721 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 198 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:31,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 111 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:13:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-12-14 05:13:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 793. [2022-12-14 05:13:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 769 states have (on average 2.920676202860858) internal successors, (2246), 792 states have internal predecessors, (2246), 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-12-14 05:13:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 2246 transitions. [2022-12-14 05:13:31,732 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 2246 transitions. Word has length 17 [2022-12-14 05:13:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:31,732 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 2246 transitions. [2022-12-14 05:13:31,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 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-12-14 05:13:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 2246 transitions. [2022-12-14 05:13:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 05:13:31,732 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:31,732 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:31,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-14 05:13:31,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-14 05:13:31,933 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:31,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:31,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1801026006, now seen corresponding path program 5 times [2022-12-14 05:13:31,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:31,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883293411] [2022-12-14 05:13:31,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:32,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:32,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883293411] [2022-12-14 05:13:32,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883293411] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:32,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961898629] [2022-12-14 05:13:32,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:13:32,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:32,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:32,276 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:32,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 05:13:32,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 05:13:32,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:32,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 05:13:32,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:32,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:32,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:32,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:32,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:32,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:32,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:32,775 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1299 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1299) c_~A~0.base) (+ c_~A~0.offset 12)) 9223372039002259456)) is different from false [2022-12-14 05:13:32,781 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1299 (Array Int Int)) (v_ArrVal_1298 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1298) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1299) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) is different from false [2022-12-14 05:13:32,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:32,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:13:32,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:32,792 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 71 treesize of output 67 [2022-12-14 05:13:32,795 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 28 treesize of output 24 [2022-12-14 05:13:32,797 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 50 treesize of output 42 [2022-12-14 05:13:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-14 05:13:32,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961898629] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:32,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1511303315] [2022-12-14 05:13:32,890 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-12-14 05:13:32,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:32,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 05:13:32,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020649907] [2022-12-14 05:13:32,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:32,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 05:13:32,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:32,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 05:13:32,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=836, Unknown=2, NotChecked=118, Total=1056 [2022-12-14 05:13:32,891 INFO L87 Difference]: Start difference. First operand 793 states and 2246 transitions. Second operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 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-12-14 05:13:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:34,054 INFO L93 Difference]: Finished difference Result 1075 states and 2906 transitions. [2022-12-14 05:13:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 05:13:34,054 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 05:13:34,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:34,057 INFO L225 Difference]: With dead ends: 1075 [2022-12-14 05:13:34,057 INFO L226 Difference]: Without dead ends: 1075 [2022-12-14 05:13:34,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=1423, Unknown=2, NotChecked=158, Total=1806 [2022-12-14 05:13:34,057 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 283 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:34,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 114 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1433 Invalid, 0 Unknown, 139 Unchecked, 0.7s Time] [2022-12-14 05:13:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2022-12-14 05:13:34,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 901. [2022-12-14 05:13:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 877 states have (on average 2.998859749144812) internal successors, (2630), 900 states have internal predecessors, (2630), 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-12-14 05:13:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 2630 transitions. [2022-12-14 05:13:34,069 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 2630 transitions. Word has length 17 [2022-12-14 05:13:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:34,069 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 2630 transitions. [2022-12-14 05:13:34,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 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-12-14 05:13:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 2630 transitions. [2022-12-14 05:13:34,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 05:13:34,069 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:34,069 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:34,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-14 05:13:34,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:34,270 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:34,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:34,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1801026007, now seen corresponding path program 3 times [2022-12-14 05:13:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:34,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112447478] [2022-12-14 05:13:34,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:34,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:34,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:34,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112447478] [2022-12-14 05:13:34,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112447478] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:34,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792746102] [2022-12-14 05:13:34,592 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:13:34,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:34,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:34,593 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:34,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-14 05:13:34,697 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:13:34,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:34,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 05:13:34,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:34,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:13:34,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:34,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:13:34,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:34,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:13:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:35,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:35,521 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:35,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-12-14 05:13:35,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:35,530 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 175 treesize of output 163 [2022-12-14 05:13:35,535 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 146 treesize of output 122 [2022-12-14 05:13:35,541 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 67 treesize of output 55 [2022-12-14 05:13:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:35,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792746102] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:35,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [486459385] [2022-12-14 05:13:35,890 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-12-14 05:13:35,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:35,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 05:13:35,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446434036] [2022-12-14 05:13:35,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:35,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 05:13:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:35,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 05:13:35,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1056, Unknown=3, NotChecked=0, Total=1190 [2022-12-14 05:13:35,892 INFO L87 Difference]: Start difference. First operand 901 states and 2630 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-12-14 05:13:41,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:41,890 INFO L93 Difference]: Finished difference Result 1665 states and 4426 transitions. [2022-12-14 05:13:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-14 05:13:41,890 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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 17 [2022-12-14 05:13:41,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:41,892 INFO L225 Difference]: With dead ends: 1665 [2022-12-14 05:13:41,893 INFO L226 Difference]: Without dead ends: 1665 [2022-12-14 05:13:41,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=743, Invalid=4656, Unknown=3, NotChecked=0, Total=5402 [2022-12-14 05:13:41,894 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 957 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 2507 mSolverCounterSat, 65 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2507 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:41,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 227 Invalid, 2573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2507 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-12-14 05:13:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2022-12-14 05:13:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1315. [2022-12-14 05:13:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1291 states have (on average 3.0100697134004646) internal successors, (3886), 1314 states have internal predecessors, (3886), 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-12-14 05:13:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 3886 transitions. [2022-12-14 05:13:41,909 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 3886 transitions. Word has length 17 [2022-12-14 05:13:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:41,910 INFO L495 AbstractCegarLoop]: Abstraction has 1315 states and 3886 transitions. [2022-12-14 05:13:41,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 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-12-14 05:13:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 3886 transitions. [2022-12-14 05:13:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 05:13:41,910 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:41,910 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2022-12-14 05:13:41,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-14 05:13:42,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:42,111 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1675308093, now seen corresponding path program 6 times [2022-12-14 05:13:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:42,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848050083] [2022-12-14 05:13:42,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:42,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:42,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848050083] [2022-12-14 05:13:42,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848050083] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:42,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847996686] [2022-12-14 05:13:42,410 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:13:42,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:42,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:42,410 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:42,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-14 05:13:42,516 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:13:42,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:42,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 05:13:42,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:42,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:42,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:42,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:42,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:42,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:42,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 05:13:42,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:42,866 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 43 treesize of output 39 [2022-12-14 05:13:42,868 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 9 treesize of output 5 [2022-12-14 05:13:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:42,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847996686] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:42,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1281735672] [2022-12-14 05:13:42,952 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-12-14 05:13:42,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:42,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-12-14 05:13:42,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981077841] [2022-12-14 05:13:42,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:42,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:13:42,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:42,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:13:42,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1148, Unknown=1, NotChecked=0, Total=1260 [2022-12-14 05:13:42,954 INFO L87 Difference]: Start difference. First operand 1315 states and 3886 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-12-14 05:13:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:43,768 INFO L93 Difference]: Finished difference Result 1895 states and 5432 transitions. [2022-12-14 05:13:43,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 05:13:43,769 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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 18 [2022-12-14 05:13:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:43,773 INFO L225 Difference]: With dead ends: 1895 [2022-12-14 05:13:43,773 INFO L226 Difference]: Without dead ends: 1895 [2022-12-14 05:13:43,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=2096, Unknown=1, NotChecked=0, Total=2352 [2022-12-14 05:13:43,775 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 143 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:43,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 60 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 05:13:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2022-12-14 05:13:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1319. [2022-12-14 05:13:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1295 states have (on average 3.01003861003861) internal successors, (3898), 1318 states have internal predecessors, (3898), 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-12-14 05:13:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 3898 transitions. [2022-12-14 05:13:43,800 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 3898 transitions. Word has length 18 [2022-12-14 05:13:43,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:43,800 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 3898 transitions. [2022-12-14 05:13:43,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-12-14 05:13:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 3898 transitions. [2022-12-14 05:13:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 05:13:43,802 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:43,802 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2022-12-14 05:13:43,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-14 05:13:44,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-14 05:13:44,002 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:44,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1675308094, now seen corresponding path program 6 times [2022-12-14 05:13:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:44,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599913644] [2022-12-14 05:13:44,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:44,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:44,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:44,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599913644] [2022-12-14 05:13:44,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599913644] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:44,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49222116] [2022-12-14 05:13:44,311 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:13:44,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:44,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:44,312 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:44,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 05:13:44,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:13:44,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:44,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 05:13:44,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:44,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:44,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:44,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:44,661 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:44,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:44,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:44,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-14 05:13:44,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:44,798 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 37 treesize of output 33 [2022-12-14 05:13:44,800 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 7 treesize of output 3 [2022-12-14 05:13:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:44,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49222116] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:44,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [786719987] [2022-12-14 05:13:44,903 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-12-14 05:13:44,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:44,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-12-14 05:13:44,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279483771] [2022-12-14 05:13:44,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:44,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 05:13:44,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:44,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 05:13:44,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1145, Unknown=4, NotChecked=0, Total=1260 [2022-12-14 05:13:44,905 INFO L87 Difference]: Start difference. First operand 1319 states and 3898 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-12-14 05:13:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:45,740 INFO L93 Difference]: Finished difference Result 1893 states and 5428 transitions. [2022-12-14 05:13:45,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 05:13:45,740 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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 18 [2022-12-14 05:13:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:45,743 INFO L225 Difference]: With dead ends: 1893 [2022-12-14 05:13:45,743 INFO L226 Difference]: Without dead ends: 1893 [2022-12-14 05:13:45,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=2093, Unknown=4, NotChecked=0, Total=2352 [2022-12-14 05:13:45,744 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 98 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:45,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 71 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 05:13:45,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2022-12-14 05:13:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1319. [2022-12-14 05:13:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1295 states have (on average 3.0084942084942083) internal successors, (3896), 1318 states have internal predecessors, (3896), 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-12-14 05:13:45,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 3896 transitions. [2022-12-14 05:13:45,765 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 3896 transitions. Word has length 18 [2022-12-14 05:13:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:45,765 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 3896 transitions. [2022-12-14 05:13:45,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 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-12-14 05:13:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 3896 transitions. [2022-12-14 05:13:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 05:13:45,766 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:45,766 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:45,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-14 05:13:45,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-14 05:13:45,967 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:45,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:45,967 INFO L85 PathProgramCache]: Analyzing trace with hash 394947035, now seen corresponding path program 4 times [2022-12-14 05:13:45,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:45,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92010319] [2022-12-14 05:13:45,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:45,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:46,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:46,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92010319] [2022-12-14 05:13:46,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92010319] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:46,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495589304] [2022-12-14 05:13:46,328 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:13:46,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:46,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:46,328 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:46,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-14 05:13:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:46,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 05:13:46,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:46,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:46,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:46,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:46,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:46,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:13:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:46,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:46,835 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1485 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-12-14 05:13:46,881 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1485 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-12-14 05:13:46,886 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1485 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1485) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 12)) 9223372039002259456))) is different from false [2022-12-14 05:13:47,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:47,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:13:47,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:47,036 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 81 treesize of output 77 [2022-12-14 05:13:47,039 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 32 treesize of output 28 [2022-12-14 05:13:47,042 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 58 treesize of output 50 [2022-12-14 05:13:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-12-14 05:13:47,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495589304] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:47,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1561046126] [2022-12-14 05:13:47,211 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-12-14 05:13:47,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:47,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-12-14 05:13:47,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980878454] [2022-12-14 05:13:47,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:47,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 05:13:47,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:47,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 05:13:47,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1276, Unknown=27, NotChecked=222, Total=1640 [2022-12-14 05:13:47,212 INFO L87 Difference]: Start difference. First operand 1319 states and 3896 transitions. Second operand has 41 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 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-12-14 05:13:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:49,468 INFO L93 Difference]: Finished difference Result 2143 states and 5703 transitions. [2022-12-14 05:13:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 05:13:49,468 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 05:13:49,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:49,472 INFO L225 Difference]: With dead ends: 2143 [2022-12-14 05:13:49,472 INFO L226 Difference]: Without dead ends: 2143 [2022-12-14 05:13:49,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=315, Invalid=2861, Unknown=28, NotChecked=336, Total=3540 [2022-12-14 05:13:49,473 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 508 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 3093 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 3547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 415 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:49,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 261 Invalid, 3547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3093 Invalid, 0 Unknown, 415 Unchecked, 1.2s Time] [2022-12-14 05:13:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2022-12-14 05:13:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 1431. [2022-12-14 05:13:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1407 states have (on average 3.0788912579957355) internal successors, (4332), 1430 states have internal predecessors, (4332), 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-12-14 05:13:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 4332 transitions. [2022-12-14 05:13:49,492 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 4332 transitions. Word has length 19 [2022-12-14 05:13:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:49,492 INFO L495 AbstractCegarLoop]: Abstraction has 1431 states and 4332 transitions. [2022-12-14 05:13:49,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 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-12-14 05:13:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 4332 transitions. [2022-12-14 05:13:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 05:13:49,493 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:49,493 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:49,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-14 05:13:49,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:49,694 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:49,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash 394947036, now seen corresponding path program 4 times [2022-12-14 05:13:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:49,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159843846] [2022-12-14 05:13:49,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:50,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:50,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159843846] [2022-12-14 05:13:50,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159843846] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:50,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052687433] [2022-12-14 05:13:50,098 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:13:50,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:50,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:50,099 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:50,100 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-14 05:13:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:50,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 05:13:50,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:50,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:50,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:50,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:50,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:50,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:50,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:50,592 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1535) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967296)) is different from false [2022-12-14 05:13:50,637 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1535) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 4294967296)) is different from false [2022-12-14 05:13:50,677 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1535) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 16)) 4294967296)) is different from false [2022-12-14 05:13:50,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:50,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:13:50,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:50,779 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 71 treesize of output 67 [2022-12-14 05:13:50,782 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 54 treesize of output 46 [2022-12-14 05:13:50,785 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 24 treesize of output 20 [2022-12-14 05:13:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-12-14 05:13:50,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052687433] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:50,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [72946296] [2022-12-14 05:13:50,941 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-12-14 05:13:50,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:50,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-12-14 05:13:50,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99601314] [2022-12-14 05:13:50,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:50,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 05:13:50,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:50,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 05:13:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1273, Unknown=30, NotChecked=222, Total=1640 [2022-12-14 05:13:50,943 INFO L87 Difference]: Start difference. First operand 1431 states and 4332 transitions. Second operand has 41 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 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-12-14 05:13:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:53,290 INFO L93 Difference]: Finished difference Result 2087 states and 5540 transitions. [2022-12-14 05:13:53,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 05:13:53,291 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 05:13:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:53,293 INFO L225 Difference]: With dead ends: 2087 [2022-12-14 05:13:53,294 INFO L226 Difference]: Without dead ends: 2087 [2022-12-14 05:13:53,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=315, Invalid=2858, Unknown=31, NotChecked=336, Total=3540 [2022-12-14 05:13:53,294 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 536 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 3253 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 3841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 551 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:53,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 266 Invalid, 3841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3253 Invalid, 0 Unknown, 551 Unchecked, 1.3s Time] [2022-12-14 05:13:53,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2022-12-14 05:13:53,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1431. [2022-12-14 05:13:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1407 states have (on average 3.03909026297086) internal successors, (4276), 1430 states have internal predecessors, (4276), 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-12-14 05:13:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 4276 transitions. [2022-12-14 05:13:53,318 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 4276 transitions. Word has length 19 [2022-12-14 05:13:53,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:53,318 INFO L495 AbstractCegarLoop]: Abstraction has 1431 states and 4276 transitions. [2022-12-14 05:13:53,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 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-12-14 05:13:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 4276 transitions. [2022-12-14 05:13:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 05:13:53,319 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:53,319 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:53,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-14 05:13:53,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-14 05:13:53,519 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:53,520 INFO L85 PathProgramCache]: Analyzing trace with hash -85800650, now seen corresponding path program 6 times [2022-12-14 05:13:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:53,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198835789] [2022-12-14 05:13:53,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:53,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:53,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198835789] [2022-12-14 05:13:53,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198835789] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:53,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519124198] [2022-12-14 05:13:53,648 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:13:53,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:53,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:53,649 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:53,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-14 05:13:53,808 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:13:53,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:13:53,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 05:13:53,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:53,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:54,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519124198] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:54,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1029883228] [2022-12-14 05:13:54,045 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-12-14 05:13:54,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:54,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-12-14 05:13:54,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683012287] [2022-12-14 05:13:54,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:54,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 05:13:54,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:54,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 05:13:54,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2022-12-14 05:13:54,046 INFO L87 Difference]: Start difference. First operand 1431 states and 4276 transitions. Second operand has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 28 states have internal predecessors, (44), 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-12-14 05:13:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:54,326 INFO L93 Difference]: Finished difference Result 1367 states and 4063 transitions. [2022-12-14 05:13:54,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 05:13:54,327 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 05:13:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:54,329 INFO L225 Difference]: With dead ends: 1367 [2022-12-14 05:13:54,329 INFO L226 Difference]: Without dead ends: 1104 [2022-12-14 05:13:54,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=314, Invalid=876, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 05:13:54,329 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 102 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:54,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 54 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:13:54,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2022-12-14 05:13:54,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1104. [2022-12-14 05:13:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1080 states have (on average 3.134259259259259) internal successors, (3385), 1103 states have internal predecessors, (3385), 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-12-14 05:13:54,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 3385 transitions. [2022-12-14 05:13:54,342 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 3385 transitions. Word has length 19 [2022-12-14 05:13:54,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:54,342 INFO L495 AbstractCegarLoop]: Abstraction has 1104 states and 3385 transitions. [2022-12-14 05:13:54,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 28 states have internal predecessors, (44), 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-12-14 05:13:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 3385 transitions. [2022-12-14 05:13:54,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 05:13:54,343 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:54,343 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1] [2022-12-14 05:13:54,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-14 05:13:54,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-14 05:13:54,544 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:54,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash -641630495, now seen corresponding path program 7 times [2022-12-14 05:13:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:54,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526418970] [2022-12-14 05:13:54,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:54,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:54,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:54,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526418970] [2022-12-14 05:13:54,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526418970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:54,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214263678] [2022-12-14 05:13:54,730 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:13:54,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:54,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:54,731 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:54,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-14 05:13:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:54,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 05:13:54,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:55,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:55,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214263678] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:55,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1248347707] [2022-12-14 05:13:55,175 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-12-14 05:13:55,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:55,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2022-12-14 05:13:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665236538] [2022-12-14 05:13:55,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:55,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 05:13:55,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:55,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 05:13:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 05:13:55,176 INFO L87 Difference]: Start difference. First operand 1104 states and 3385 transitions. Second operand has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 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-12-14 05:13:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:55,709 INFO L93 Difference]: Finished difference Result 1382 states and 3667 transitions. [2022-12-14 05:13:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 05:13:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 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 20 [2022-12-14 05:13:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:55,712 INFO L225 Difference]: With dead ends: 1382 [2022-12-14 05:13:55,712 INFO L226 Difference]: Without dead ends: 1358 [2022-12-14 05:13:55,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=549, Invalid=1521, Unknown=0, NotChecked=0, Total=2070 [2022-12-14 05:13:55,712 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 290 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:55,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 85 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:13:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-12-14 05:13:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1056. [2022-12-14 05:13:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1032 states have (on average 2.9108527131782944) internal successors, (3004), 1055 states have internal predecessors, (3004), 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-12-14 05:13:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 3004 transitions. [2022-12-14 05:13:55,726 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 3004 transitions. Word has length 20 [2022-12-14 05:13:55,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:55,726 INFO L495 AbstractCegarLoop]: Abstraction has 1056 states and 3004 transitions. [2022-12-14 05:13:55,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 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-12-14 05:13:55,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 3004 transitions. [2022-12-14 05:13:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 05:13:55,726 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:55,726 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:55,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-12-14 05:13:55,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-14 05:13:55,927 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:55,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:55,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1224822964, now seen corresponding path program 7 times [2022-12-14 05:13:55,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:55,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276157293] [2022-12-14 05:13:55,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:55,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:56,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:56,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276157293] [2022-12-14 05:13:56,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276157293] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:56,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566399807] [2022-12-14 05:13:56,295 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:13:56,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:56,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:56,296 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:56,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-14 05:13:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:56,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 05:13:56,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:56,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:13:56,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:56,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:56,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:56,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:56,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:57,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:57,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:13:57,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:13:57,103 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 71 treesize of output 67 [2022-12-14 05:13:57,106 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 54 treesize of output 46 [2022-12-14 05:13:57,109 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 24 treesize of output 20 [2022-12-14 05:13:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:57,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566399807] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:57,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1608069036] [2022-12-14 05:13:57,310 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-12-14 05:13:57,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:57,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2022-12-14 05:13:57,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147808545] [2022-12-14 05:13:57,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:57,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 05:13:57,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:57,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 05:13:57,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1505, Unknown=10, NotChecked=0, Total=1640 [2022-12-14 05:13:57,312 INFO L87 Difference]: Start difference. First operand 1056 states and 3004 transitions. Second operand has 41 states, 40 states have (on average 1.5) internal successors, (60), 40 states have internal predecessors, (60), 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-12-14 05:13:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:59,309 INFO L93 Difference]: Finished difference Result 1396 states and 3759 transitions. [2022-12-14 05:13:59,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 05:13:59,309 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.5) internal successors, (60), 40 states have internal predecessors, (60), 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 20 [2022-12-14 05:13:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:59,311 INFO L225 Difference]: With dead ends: 1396 [2022-12-14 05:13:59,311 INFO L226 Difference]: Without dead ends: 1396 [2022-12-14 05:13:59,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=355, Invalid=3057, Unknown=10, NotChecked=0, Total=3422 [2022-12-14 05:13:59,311 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 383 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:59,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 195 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 05:13:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2022-12-14 05:13:59,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1188. [2022-12-14 05:13:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1164 states have (on average 2.9536082474226806) internal successors, (3438), 1187 states have internal predecessors, (3438), 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-12-14 05:13:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 3438 transitions. [2022-12-14 05:13:59,324 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 3438 transitions. Word has length 20 [2022-12-14 05:13:59,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:59,324 INFO L495 AbstractCegarLoop]: Abstraction has 1188 states and 3438 transitions. [2022-12-14 05:13:59,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.5) internal successors, (60), 40 states have internal predecessors, (60), 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-12-14 05:13:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 3438 transitions. [2022-12-14 05:13:59,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:13:59,325 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:59,325 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1] [2022-12-14 05:13:59,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-12-14 05:13:59,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-14 05:13:59,526 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:13:59,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:59,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1591583861, now seen corresponding path program 8 times [2022-12-14 05:13:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:59,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354368791] [2022-12-14 05:13:59,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:59,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:59,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:59,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354368791] [2022-12-14 05:13:59,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354368791] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:59,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522973747] [2022-12-14 05:13:59,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:13:59,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:59,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:59,947 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:59,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-14 05:14:00,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 05:14:00,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:14:00,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 05:14:00,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:14:00,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:14:00,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:00,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:14:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:00,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:14:01,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:14:01,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 05:14:01,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:14:01,335 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 47 treesize of output 43 [2022-12-14 05:14:01,339 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 15 treesize of output 9 [2022-12-14 05:14:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:01,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522973747] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:14:01,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [470986132] [2022-12-14 05:14:01,786 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-12-14 05:14:01,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:14:01,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-12-14 05:14:01,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812993635] [2022-12-14 05:14:01,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:14:01,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 05:14:01,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:14:01,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 05:14:01,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1683, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 05:14:01,788 INFO L87 Difference]: Start difference. First operand 1188 states and 3438 transitions. Second operand has 44 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 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-12-14 05:14:02,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:14:15,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:14:15,458 INFO L93 Difference]: Finished difference Result 3787 states and 9902 transitions. [2022-12-14 05:14:15,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-12-14 05:14:15,459 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 05:14:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:14:15,464 INFO L225 Difference]: With dead ends: 3787 [2022-12-14 05:14:15,464 INFO L226 Difference]: Without dead ends: 3787 [2022-12-14 05:14:15,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5483 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2320, Invalid=17140, Unknown=0, NotChecked=0, Total=19460 [2022-12-14 05:14:15,465 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 640 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 3767 mSolverCounterSat, 70 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 3838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3767 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:14:15,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 176 Invalid, 3838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3767 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-12-14 05:14:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-12-14 05:14:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 1626. [2022-12-14 05:14:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1602 states have (on average 3.1560549313358304) internal successors, (5056), 1625 states have internal predecessors, (5056), 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-12-14 05:14:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 5056 transitions. [2022-12-14 05:14:15,492 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 5056 transitions. Word has length 21 [2022-12-14 05:14:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:14:15,493 INFO L495 AbstractCegarLoop]: Abstraction has 1626 states and 5056 transitions. [2022-12-14 05:14:15,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 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-12-14 05:14:15,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 5056 transitions. [2022-12-14 05:14:15,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:14:15,493 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:14:15,493 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1] [2022-12-14 05:14:15,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-12-14 05:14:15,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-12-14 05:14:15,694 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:14:15,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:14:15,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1591583860, now seen corresponding path program 7 times [2022-12-14 05:14:15,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:14:15,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108140958] [2022-12-14 05:14:15,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:14:15,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:14:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:14:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:16,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:14:16,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108140958] [2022-12-14 05:14:16,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108140958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:14:16,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395558628] [2022-12-14 05:14:16,090 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:14:16,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:14:16,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:14:16,091 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:14:16,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-14 05:14:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:14:16,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 05:14:16,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:14:16,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:14:16,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:16,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:14:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:16,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:14:16,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:14:16,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-14 05:14:16,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:14:16,729 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 37 treesize of output 33 [2022-12-14 05:14:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:16,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395558628] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:14:16,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [164441154] [2022-12-14 05:14:16,896 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-12-14 05:14:16,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:14:16,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-12-14 05:14:16,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960574536] [2022-12-14 05:14:16,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:14:16,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 05:14:16,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:14:16,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 05:14:16,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1753, Unknown=9, NotChecked=0, Total=1892 [2022-12-14 05:14:16,897 INFO L87 Difference]: Start difference. First operand 1626 states and 5056 transitions. Second operand has 44 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 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-12-14 05:14:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:14:18,392 INFO L93 Difference]: Finished difference Result 2332 states and 6985 transitions. [2022-12-14 05:14:18,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 05:14:18,392 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 05:14:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:14:18,395 INFO L225 Difference]: With dead ends: 2332 [2022-12-14 05:14:18,395 INFO L226 Difference]: Without dead ends: 2332 [2022-12-14 05:14:18,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=365, Invalid=3916, Unknown=9, NotChecked=0, Total=4290 [2022-12-14 05:14:18,396 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 184 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:14:18,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 76 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 05:14:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2022-12-14 05:14:18,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 1631. [2022-12-14 05:14:18,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1607 states have (on average 3.1530802738021158) internal successors, (5067), 1630 states have internal predecessors, (5067), 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-12-14 05:14:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 5067 transitions. [2022-12-14 05:14:18,419 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 5067 transitions. Word has length 21 [2022-12-14 05:14:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:14:18,419 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 5067 transitions. [2022-12-14 05:14:18,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 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-12-14 05:14:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 5067 transitions. [2022-12-14 05:14:18,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:14:18,420 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:14:18,420 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:14:18,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-12-14 05:14:18,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:14:18,621 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:14:18,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:14:18,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2120190967, now seen corresponding path program 4 times [2022-12-14 05:14:18,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:14:18,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895839208] [2022-12-14 05:14:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:14:18,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:14:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:14:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:19,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:14:19,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895839208] [2022-12-14 05:14:19,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895839208] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:14:19,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227703433] [2022-12-14 05:14:19,002 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:14:19,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:14:19,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:14:19,003 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:14:19,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-14 05:14:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:14:19,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 05:14:19,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:14:19,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:14:19,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:19,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-14 05:14:19,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:19,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:14:19,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:19,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:14:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:19,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:14:19,607 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1823 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1823) c_~A~0.base) (+ c_~A~0.offset 16)) 4294967296))) is different from false [2022-12-14 05:14:19,738 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 05:14:19,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-12-14 05:14:19,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:14:19,743 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 81 treesize of output 77 [2022-12-14 05:14:19,745 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 62 treesize of output 54 [2022-12-14 05:14:19,748 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 28 treesize of output 24 [2022-12-14 05:14:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:19,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227703433] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:14:19,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [215692565] [2022-12-14 05:14:19,877 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-12-14 05:14:19,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:14:19,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2022-12-14 05:14:19,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440785753] [2022-12-14 05:14:19,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:14:19,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 05:14:19,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:14:19,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 05:14:19,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1497, Unknown=11, NotChecked=78, Total=1722 [2022-12-14 05:14:19,878 INFO L87 Difference]: Start difference. First operand 1631 states and 5067 transitions. Second operand has 42 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 41 states have internal predecessors, (60), 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-12-14 05:14:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:14:21,442 INFO L93 Difference]: Finished difference Result 1911 states and 5477 transitions. [2022-12-14 05:14:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 05:14:21,442 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 41 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 05:14:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:14:21,445 INFO L225 Difference]: With dead ends: 1911 [2022-12-14 05:14:21,445 INFO L226 Difference]: Without dead ends: 1911 [2022-12-14 05:14:21,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=334, Invalid=2415, Unknown=11, NotChecked=102, Total=2862 [2022-12-14 05:14:21,446 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 284 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:14:21,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 181 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2273 Invalid, 0 Unknown, 128 Unchecked, 1.0s Time] [2022-12-14 05:14:21,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2022-12-14 05:14:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1631. [2022-12-14 05:14:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1607 states have (on average 3.115743621655258) internal successors, (5007), 1630 states have internal predecessors, (5007), 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-12-14 05:14:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 5007 transitions. [2022-12-14 05:14:21,465 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 5007 transitions. Word has length 21 [2022-12-14 05:14:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:14:21,465 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 5007 transitions. [2022-12-14 05:14:21,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 41 states have internal predecessors, (60), 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-12-14 05:14:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 5007 transitions. [2022-12-14 05:14:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 05:14:21,466 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:14:21,466 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1] [2022-12-14 05:14:21,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-12-14 05:14:21,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:14:21,668 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:14:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:14:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2094455731, now seen corresponding path program 5 times [2022-12-14 05:14:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:14:21,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398064303] [2022-12-14 05:14:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:14:21,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:14:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:14:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:22,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:14:22,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398064303] [2022-12-14 05:14:22,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398064303] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:14:22,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825549232] [2022-12-14 05:14:22,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:14:22,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:14:22,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:14:22,162 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:14:22,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-14 05:14:22,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 05:14:22,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:14:22,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 05:14:22,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:14:22,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:14:22,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:22,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:14:23,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:23,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:14:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:23,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:14:23,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:14:23,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-12-14 05:14:23,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:14:23,730 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 89 treesize of output 85 [2022-12-14 05:14:23,733 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 68 treesize of output 56 [2022-12-14 05:14:23,736 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 30 treesize of output 24 [2022-12-14 05:14:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:24,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825549232] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:14:24,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1779220915] [2022-12-14 05:14:24,199 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-12-14 05:14:24,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:14:24,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2022-12-14 05:14:24,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900680935] [2022-12-14 05:14:24,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:14:24,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-14 05:14:24,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:14:24,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-14 05:14:24,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1931, Unknown=4, NotChecked=0, Total=2162 [2022-12-14 05:14:24,201 INFO L87 Difference]: Start difference. First operand 1631 states and 5007 transitions. Second operand has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 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-12-14 05:14:25,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:14:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:14:47,500 INFO L93 Difference]: Finished difference Result 4825 states and 12706 transitions. [2022-12-14 05:14:47,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-12-14 05:14:47,501 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 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-12-14 05:14:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:14:47,507 INFO L225 Difference]: With dead ends: 4825 [2022-12-14 05:14:47,507 INFO L226 Difference]: Without dead ends: 4825 [2022-12-14 05:14:47,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=1759, Invalid=13489, Unknown=4, NotChecked=0, Total=15252 [2022-12-14 05:14:47,508 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 2530 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 8072 mSolverCounterSat, 260 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2530 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 8333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 8072 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:14:47,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2530 Valid, 739 Invalid, 8333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 8072 Invalid, 1 Unknown, 0 Unchecked, 8.9s Time] [2022-12-14 05:14:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4825 states. [2022-12-14 05:14:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4825 to 2223. [2022-12-14 05:14:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2199 states have (on average 3.1473396998635743) internal successors, (6921), 2222 states have internal predecessors, (6921), 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-12-14 05:14:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 6921 transitions. [2022-12-14 05:14:47,543 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 6921 transitions. Word has length 22 [2022-12-14 05:14:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:14:47,543 INFO L495 AbstractCegarLoop]: Abstraction has 2223 states and 6921 transitions. [2022-12-14 05:14:47,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 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-12-14 05:14:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 6921 transitions. [2022-12-14 05:14:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 05:14:47,544 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:14:47,544 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1] [2022-12-14 05:14:47,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-12-14 05:14:47,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:14:47,746 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:14:47,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:14:47,747 INFO L85 PathProgramCache]: Analyzing trace with hash -2094455730, now seen corresponding path program 5 times [2022-12-14 05:14:47,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:14:47,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90653132] [2022-12-14 05:14:47,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:14:47,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:14:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:14:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:48,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:14:48,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90653132] [2022-12-14 05:14:48,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90653132] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:14:48,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888236003] [2022-12-14 05:14:48,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:14:48,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:14:48,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:14:48,280 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:14:48,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-14 05:14:48,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 05:14:48,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:14:48,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 05:14:48,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:14:48,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:14:48,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:48,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:14:49,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:49,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:14:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:49,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:14:49,131 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1931 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1931) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967296)) is different from false [2022-12-14 05:14:49,136 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1931 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1931) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 4294967296)) is different from false [2022-12-14 05:14:49,142 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1931 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1931) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 4294967296)) is different from false [2022-12-14 05:14:49,148 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1931 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1931) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 12)) 4294967296)) is different from false [2022-12-14 05:14:49,155 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1931 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1931) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 16)) 4294967296)) is different from false [2022-12-14 05:14:49,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:14:49,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:14:49,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:14:49,323 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 141 treesize of output 131 [2022-12-14 05:14:49,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 118 treesize of output 102 [2022-12-14 05:14:49,329 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 102 treesize of output 94 [2022-12-14 05:14:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2022-12-14 05:14:49,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888236003] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:14:49,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1442310344] [2022-12-14 05:14:49,569 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-12-14 05:14:49,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:14:49,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2022-12-14 05:14:49,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74724562] [2022-12-14 05:14:49,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:14:49,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-14 05:14:49,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:14:49,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-14 05:14:49,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1566, Unknown=25, NotChecked=420, Total=2162 [2022-12-14 05:14:49,570 INFO L87 Difference]: Start difference. First operand 2223 states and 6921 transitions. Second operand has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 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-12-14 05:14:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:14:52,217 INFO L93 Difference]: Finished difference Result 3005 states and 8609 transitions. [2022-12-14 05:14:52,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 05:14:52,218 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 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-12-14 05:14:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:14:52,222 INFO L225 Difference]: With dead ends: 3005 [2022-12-14 05:14:52,222 INFO L226 Difference]: Without dead ends: 3005 [2022-12-14 05:14:52,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=331, Invalid=2855, Unknown=26, NotChecked=570, Total=3782 [2022-12-14 05:14:52,223 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 312 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 3613 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 4500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 3613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 856 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:14:52,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 290 Invalid, 4500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 3613 Invalid, 0 Unknown, 856 Unchecked, 1.9s Time] [2022-12-14 05:14:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2022-12-14 05:14:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2408. [2022-12-14 05:14:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2384 states have (on average 3.1308724832214767) internal successors, (7464), 2407 states have internal predecessors, (7464), 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-12-14 05:14:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 7464 transitions. [2022-12-14 05:14:52,254 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 7464 transitions. Word has length 22 [2022-12-14 05:14:52,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:14:52,254 INFO L495 AbstractCegarLoop]: Abstraction has 2408 states and 7464 transitions. [2022-12-14 05:14:52,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 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-12-14 05:14:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 7464 transitions. [2022-12-14 05:14:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 05:14:52,255 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:14:52,255 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:14:52,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-12-14 05:14:52,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-14 05:14:52,456 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:14:52,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:14:52,456 INFO L85 PathProgramCache]: Analyzing trace with hash -233801428, now seen corresponding path program 8 times [2022-12-14 05:14:52,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:14:52,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036460107] [2022-12-14 05:14:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:14:52,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:14:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:14:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:52,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:14:52,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036460107] [2022-12-14 05:14:52,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036460107] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:14:52,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562013982] [2022-12-14 05:14:52,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:14:52,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:14:52,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:14:52,617 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:14:52,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-14 05:14:53,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 05:14:53,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:14:53,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 05:14:53,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:14:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:53,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:14:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:53,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562013982] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:14:53,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2123612370] [2022-12-14 05:14:53,384 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-12-14 05:14:53,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:14:53,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2022-12-14 05:14:53,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070622220] [2022-12-14 05:14:53,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:14:53,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 05:14:53,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:14:53,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 05:14:53,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 05:14:53,385 INFO L87 Difference]: Start difference. First operand 2408 states and 7464 transitions. Second operand has 34 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 33 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-12-14 05:14:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:14:53,768 INFO L93 Difference]: Finished difference Result 2308 states and 7137 transitions. [2022-12-14 05:14:53,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 05:14:53,769 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 33 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 22 [2022-12-14 05:14:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:14:53,772 INFO L225 Difference]: With dead ends: 2308 [2022-12-14 05:14:53,772 INFO L226 Difference]: Without dead ends: 1945 [2022-12-14 05:14:53,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=422, Invalid=1218, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 05:14:53,772 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 90 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:14:53,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 71 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:14:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2022-12-14 05:14:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1945. [2022-12-14 05:14:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1945 states, 1921 states have (on average 3.2165538781884435) internal successors, (6179), 1944 states have internal predecessors, (6179), 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-12-14 05:14:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 6179 transitions. [2022-12-14 05:14:53,795 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 6179 transitions. Word has length 22 [2022-12-14 05:14:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:14:53,796 INFO L495 AbstractCegarLoop]: Abstraction has 1945 states and 6179 transitions. [2022-12-14 05:14:53,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 33 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-12-14 05:14:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 6179 transitions. [2022-12-14 05:14:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:14:53,797 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:14:53,797 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1] [2022-12-14 05:14:53,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-14 05:14:53,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-12-14 05:14:53,997 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:14:53,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:14:53,998 INFO L85 PathProgramCache]: Analyzing trace with hash -503704912, now seen corresponding path program 8 times [2022-12-14 05:14:53,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:14:53,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408968004] [2022-12-14 05:14:53,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:14:53,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:14:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:14:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:54,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:14:54,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408968004] [2022-12-14 05:14:54,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408968004] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:14:54,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567748056] [2022-12-14 05:14:54,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:14:54,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:14:54,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:14:54,199 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:14:54,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-14 05:14:54,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-12-14 05:14:54,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:14:54,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 05:14:54,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:14:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:54,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:14:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:54,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567748056] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:14:54,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [489467248] [2022-12-14 05:14:54,960 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-12-14 05:14:54,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:14:54,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2022-12-14 05:14:54,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30858378] [2022-12-14 05:14:54,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:14:54,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 05:14:54,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:14:54,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 05:14:54,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1111, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 05:14:54,961 INFO L87 Difference]: Start difference. First operand 1945 states and 6179 transitions. Second operand has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 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-12-14 05:14:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:14:55,707 INFO L93 Difference]: Finished difference Result 2397 states and 6808 transitions. [2022-12-14 05:14:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 05:14:55,708 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 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-12-14 05:14:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:14:55,711 INFO L225 Difference]: With dead ends: 2397 [2022-12-14 05:14:55,711 INFO L226 Difference]: Without dead ends: 2369 [2022-12-14 05:14:55,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=719, Invalid=2037, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 05:14:55,712 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 266 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:14:55,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 105 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 05:14:55,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2022-12-14 05:14:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1879. [2022-12-14 05:14:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1879 states, 1855 states have (on average 3.101347708894879) internal successors, (5753), 1878 states have internal predecessors, (5753), 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-12-14 05:14:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 5753 transitions. [2022-12-14 05:14:55,736 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 5753 transitions. Word has length 23 [2022-12-14 05:14:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:14:55,737 INFO L495 AbstractCegarLoop]: Abstraction has 1879 states and 5753 transitions. [2022-12-14 05:14:55,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 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-12-14 05:14:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 5753 transitions. [2022-12-14 05:14:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:14:55,737 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:14:55,738 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:14:55,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-12-14 05:14:55,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:14:55,939 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:14:55,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:14:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1689047894, now seen corresponding path program 9 times [2022-12-14 05:14:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:14:55,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656647876] [2022-12-14 05:14:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:14:55,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:14:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:14:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:56,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:14:56,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656647876] [2022-12-14 05:14:56,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656647876] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:14:56,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488234018] [2022-12-14 05:14:56,389 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:14:56,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:14:56,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:14:56,390 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:14:56,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-14 05:14:56,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:14:56,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:14:56,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 05:14:56,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:14:56,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:14:56,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:56,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:14:56,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:56,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:14:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:56,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:14:57,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:14:57,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:14:57,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:14:57,173 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 71 treesize of output 67 [2022-12-14 05:14:57,178 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 28 treesize of output 24 [2022-12-14 05:14:57,181 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 50 treesize of output 42 [2022-12-14 05:14:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:14:57,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488234018] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:14:57,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1129373541] [2022-12-14 05:14:57,398 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-12-14 05:14:57,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:14:57,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2022-12-14 05:14:57,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325336235] [2022-12-14 05:14:57,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:14:57,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-14 05:14:57,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:14:57,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-14 05:14:57,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1827, Unknown=8, NotChecked=0, Total=1980 [2022-12-14 05:14:57,399 INFO L87 Difference]: Start difference. First operand 1879 states and 5753 transitions. Second operand has 45 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 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-12-14 05:14:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:14:59,624 INFO L93 Difference]: Finished difference Result 2587 states and 7348 transitions. [2022-12-14 05:14:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 05:14:59,625 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 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-12-14 05:14:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:14:59,628 INFO L225 Difference]: With dead ends: 2587 [2022-12-14 05:14:59,628 INFO L226 Difference]: Without dead ends: 2587 [2022-12-14 05:14:59,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=350, Invalid=3064, Unknown=8, NotChecked=0, Total=3422 [2022-12-14 05:14:59,628 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 374 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 3475 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 3493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:14:59,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 282 Invalid, 3493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3475 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 05:14:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2022-12-14 05:14:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 2079. [2022-12-14 05:14:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2055 states have (on average 3.1664233576642338) internal successors, (6507), 2078 states have internal predecessors, (6507), 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-12-14 05:14:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 6507 transitions. [2022-12-14 05:14:59,655 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 6507 transitions. Word has length 23 [2022-12-14 05:14:59,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:14:59,655 INFO L495 AbstractCegarLoop]: Abstraction has 2079 states and 6507 transitions. [2022-12-14 05:14:59,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 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-12-14 05:14:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 6507 transitions. [2022-12-14 05:14:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 05:14:59,656 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:14:59,656 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:14:59,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-12-14 05:14:59,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-14 05:14:59,857 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:14:59,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:14:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1689047895, now seen corresponding path program 5 times [2022-12-14 05:14:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:14:59,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209597331] [2022-12-14 05:14:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:14:59,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:14:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:15:00,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:15:00,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209597331] [2022-12-14 05:15:00,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209597331] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:15:00,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356612436] [2022-12-14 05:15:00,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:15:00,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:15:00,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:15:00,377 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:15:00,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-14 05:15:00,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 05:15:00,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:15:00,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 05:15:00,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:15:00,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:15:00,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:00,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:15:00,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:00,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:15:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 25 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:15:01,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:15:01,646 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:15:01,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-12-14 05:15:01,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:15:01,653 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 175 treesize of output 163 [2022-12-14 05:15:01,658 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 73 treesize of output 61 [2022-12-14 05:15:01,662 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 134 treesize of output 110 [2022-12-14 05:15:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:15:02,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356612436] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:15:02,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2091477754] [2022-12-14 05:15:02,137 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-12-14 05:15:02,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:15:02,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2022-12-14 05:15:02,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147172134] [2022-12-14 05:15:02,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:15:02,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-14 05:15:02,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:15:02,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-14 05:15:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1940, Unknown=3, NotChecked=0, Total=2162 [2022-12-14 05:15:02,139 INFO L87 Difference]: Start difference. First operand 2079 states and 6507 transitions. Second operand has 47 states, 46 states have (on average 1.5) internal successors, (69), 46 states have internal predecessors, (69), 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-12-14 05:15:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:15:53,780 INFO L93 Difference]: Finished difference Result 2695 states and 7273 transitions. [2022-12-14 05:15:53,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-14 05:15:53,780 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.5) internal successors, (69), 46 states have internal predecessors, (69), 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-12-14 05:15:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:15:53,784 INFO L225 Difference]: With dead ends: 2695 [2022-12-14 05:15:53,784 INFO L226 Difference]: Without dead ends: 2695 [2022-12-14 05:15:53,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=1209, Invalid=9500, Unknown=3, NotChecked=0, Total=10712 [2022-12-14 05:15:53,784 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1200 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 5042 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 5133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 5042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:15:53,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 452 Invalid, 5133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 5042 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-12-14 05:15:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2022-12-14 05:15:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2213. [2022-12-14 05:15:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2189 states have (on average 3.007309273640932) internal successors, (6583), 2212 states have internal predecessors, (6583), 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-12-14 05:15:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 6583 transitions. [2022-12-14 05:15:53,808 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 6583 transitions. Word has length 23 [2022-12-14 05:15:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:15:53,808 INFO L495 AbstractCegarLoop]: Abstraction has 2213 states and 6583 transitions. [2022-12-14 05:15:53,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.5) internal successors, (69), 46 states have internal predecessors, (69), 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-12-14 05:15:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 6583 transitions. [2022-12-14 05:15:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:15:53,809 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:15:53,809 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1] [2022-12-14 05:15:53,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-14 05:15:54,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:15:54,012 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:15:54,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:15:54,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1024918074, now seen corresponding path program 9 times [2022-12-14 05:15:54,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:15:54,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192124373] [2022-12-14 05:15:54,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:54,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:15:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:15:54,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:15:54,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192124373] [2022-12-14 05:15:54,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192124373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:15:54,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571920355] [2022-12-14 05:15:54,466 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:15:54,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:15:54,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:15:54,467 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:15:54,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-14 05:15:54,668 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:15:54,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:15:54,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 05:15:54,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:15:54,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:15:54,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:54,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:15:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:15:55,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:15:55,432 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:15:55,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-14 05:15:55,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:15:55,439 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 37 treesize of output 33 [2022-12-14 05:15:55,448 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 7 treesize of output 3 [2022-12-14 05:15:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:15:55,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571920355] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:15:55,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1712882320] [2022-12-14 05:15:55,674 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-12-14 05:15:55,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:15:55,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2022-12-14 05:15:55,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252521459] [2022-12-14 05:15:55,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:15:55,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-14 05:15:55,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:15:55,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-14 05:15:55,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2101, Unknown=4, NotChecked=0, Total=2256 [2022-12-14 05:15:55,675 INFO L87 Difference]: Start difference. First operand 2213 states and 6583 transitions. Second operand has 48 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 47 states have internal predecessors, (69), 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-12-14 05:15:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:15:57,125 INFO L93 Difference]: Finished difference Result 3195 states and 9209 transitions. [2022-12-14 05:15:57,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 05:15:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 47 states have internal predecessors, (69), 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 24 [2022-12-14 05:15:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:15:57,130 INFO L225 Difference]: With dead ends: 3195 [2022-12-14 05:15:57,130 INFO L226 Difference]: Without dead ends: 3195 [2022-12-14 05:15:57,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=345, Invalid=3811, Unknown=4, NotChecked=0, Total=4160 [2022-12-14 05:15:57,131 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 98 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:15:57,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 91 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 05:15:57,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2022-12-14 05:15:57,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 2217. [2022-12-14 05:15:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 2193 states have (on average 3.0068399452804377) internal successors, (6594), 2216 states have internal predecessors, (6594), 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-12-14 05:15:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 6594 transitions. [2022-12-14 05:15:57,168 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 6594 transitions. Word has length 24 [2022-12-14 05:15:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:15:57,169 INFO L495 AbstractCegarLoop]: Abstraction has 2217 states and 6594 transitions. [2022-12-14 05:15:57,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 47 states have internal predecessors, (69), 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-12-14 05:15:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 6594 transitions. [2022-12-14 05:15:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:15:57,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:15:57,170 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 1, 1, 1, 1, 1] [2022-12-14 05:15:57,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-12-14 05:15:57,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-12-14 05:15:57,371 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:15:57,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:15:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2656913, now seen corresponding path program 9 times [2022-12-14 05:15:57,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:15:57,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228636983] [2022-12-14 05:15:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:57,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:15:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:15:57,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:15:57,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228636983] [2022-12-14 05:15:57,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228636983] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:15:57,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230539087] [2022-12-14 05:15:57,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:15:57,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:15:57,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:15:57,955 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:15:57,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-14 05:15:58,167 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:15:58,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:15:58,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-14 05:15:58,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:15:58,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:15:58,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:58,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-14 05:15:58,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:58,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:15:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:15:58,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:15:58,942 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 05:15:58,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2022-12-14 05:15:58,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:15:58,948 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 43 treesize of output 39 [2022-12-14 05:15:58,958 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 9 treesize of output 5 [2022-12-14 05:15:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:15:59,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230539087] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:15:59,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [596569843] [2022-12-14 05:15:59,177 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-12-14 05:15:59,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:15:59,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2022-12-14 05:15:59,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108415963] [2022-12-14 05:15:59,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:15:59,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-14 05:15:59,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:15:59,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-14 05:15:59,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2366, Unknown=18, NotChecked=0, Total=2550 [2022-12-14 05:15:59,178 INFO L87 Difference]: Start difference. First operand 2217 states and 6594 transitions. Second operand has 51 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 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-12-14 05:16:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:16:00,736 INFO L93 Difference]: Finished difference Result 3225 states and 9273 transitions. [2022-12-14 05:16:00,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 05:16:00,736 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 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-12-14 05:16:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:16:00,740 INFO L225 Difference]: With dead ends: 3225 [2022-12-14 05:16:00,740 INFO L226 Difference]: Without dead ends: 3225 [2022-12-14 05:16:00,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=408, Invalid=4130, Unknown=18, NotChecked=0, Total=4556 [2022-12-14 05:16:00,741 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 136 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:16:00,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 120 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 05:16:00,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2022-12-14 05:16:00,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 2217. [2022-12-14 05:16:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 2193 states have (on average 3.0063839489284088) internal successors, (6593), 2216 states have internal predecessors, (6593), 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-12-14 05:16:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 6593 transitions. [2022-12-14 05:16:00,768 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 6593 transitions. Word has length 25 [2022-12-14 05:16:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:16:00,768 INFO L495 AbstractCegarLoop]: Abstraction has 2217 states and 6593 transitions. [2022-12-14 05:16:00,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 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-12-14 05:16:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 6593 transitions. [2022-12-14 05:16:00,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:16:00,769 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:16:00,769 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1] [2022-12-14 05:16:00,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-12-14 05:16:00,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-14 05:16:00,970 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:16:00,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:16:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1707685548, now seen corresponding path program 6 times [2022-12-14 05:16:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:16:00,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912911619] [2022-12-14 05:16:00,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:16:00,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:16:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:16:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:01,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:16:01,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912911619] [2022-12-14 05:16:01,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912911619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:16:01,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479085440] [2022-12-14 05:16:01,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:16:01,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:16:01,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:16:01,558 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:16:01,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-14 05:16:01,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:16:01,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:16:01,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 05:16:01,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:16:01,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:16:01,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:16:01,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:16:02,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:16:02,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:16:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:02,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:16:02,262 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2301 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2301) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967296)) is different from false [2022-12-14 05:16:02,314 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2301 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2301) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 4294967296)) is different from false [2022-12-14 05:16:02,469 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2301 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2301) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 24)) 4294967296)) is different from false [2022-12-14 05:16:02,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:16:02,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:16:02,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:16:02,597 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 71 treesize of output 67 [2022-12-14 05:16:02,600 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 28 treesize of output 24 [2022-12-14 05:16:02,602 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 50 treesize of output 42 [2022-12-14 05:16:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2022-12-14 05:16:02,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479085440] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:16:02,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [83642057] [2022-12-14 05:16:02,826 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-12-14 05:16:02,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:16:02,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2022-12-14 05:16:02,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104885708] [2022-12-14 05:16:02,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:16:02,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-12-14 05:16:02,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:16:02,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-12-14 05:16:02,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2241, Unknown=45, NotChecked=294, Total=2756 [2022-12-14 05:16:02,827 INFO L87 Difference]: Start difference. First operand 2217 states and 6593 transitions. Second operand has 53 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 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-12-14 05:16:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:16:05,635 INFO L93 Difference]: Finished difference Result 3616 states and 9535 transitions. [2022-12-14 05:16:05,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 05:16:05,635 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 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-12-14 05:16:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:16:05,640 INFO L225 Difference]: With dead ends: 3616 [2022-12-14 05:16:05,640 INFO L226 Difference]: Without dead ends: 3616 [2022-12-14 05:16:05,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=387, Invalid=4002, Unknown=45, NotChecked=396, Total=4830 [2022-12-14 05:16:05,640 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 480 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 4510 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 5110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 560 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:16:05,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 367 Invalid, 5110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4510 Invalid, 0 Unknown, 560 Unchecked, 2.1s Time] [2022-12-14 05:16:05,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2022-12-14 05:16:05,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 2377. [2022-12-14 05:16:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2377 states, 2353 states have (on average 3.041223969400765) internal successors, (7156), 2376 states have internal predecessors, (7156), 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-12-14 05:16:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 7156 transitions. [2022-12-14 05:16:05,669 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 7156 transitions. Word has length 25 [2022-12-14 05:16:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:16:05,669 INFO L495 AbstractCegarLoop]: Abstraction has 2377 states and 7156 transitions. [2022-12-14 05:16:05,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 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-12-14 05:16:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 7156 transitions. [2022-12-14 05:16:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 05:16:05,670 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:16:05,671 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:16:05,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-12-14 05:16:05,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:16:05,872 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:16:05,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:16:05,873 INFO L85 PathProgramCache]: Analyzing trace with hash -322583882, now seen corresponding path program 10 times [2022-12-14 05:16:05,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:16:05,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628572136] [2022-12-14 05:16:05,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:16:05,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:16:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:16:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:06,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:16:06,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628572136] [2022-12-14 05:16:06,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628572136] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:16:06,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270008021] [2022-12-14 05:16:06,112 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:16:06,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:16:06,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:16:06,113 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:16:06,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-14 05:16:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:16:06,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 05:16:06,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:16:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:06,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:16:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:06,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270008021] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:16:06,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1264132735] [2022-12-14 05:16:06,731 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-12-14 05:16:06,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:16:06,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2022-12-14 05:16:06,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883602306] [2022-12-14 05:16:06,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:16:06,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 05:16:06,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:16:06,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 05:16:06,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1111, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 05:16:06,733 INFO L87 Difference]: Start difference. First operand 2377 states and 7156 transitions. Second operand has 39 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 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-12-14 05:16:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:16:07,217 INFO L93 Difference]: Finished difference Result 2289 states and 6863 transitions. [2022-12-14 05:16:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 05:16:07,217 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 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-12-14 05:16:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:16:07,220 INFO L225 Difference]: With dead ends: 2289 [2022-12-14 05:16:07,220 INFO L226 Difference]: Without dead ends: 1810 [2022-12-14 05:16:07,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 19 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=546, Invalid=1616, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 05:16:07,221 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 193 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:16:07,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 100 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:16:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2022-12-14 05:16:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2022-12-14 05:16:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1786 states have (on average 3.1226203807390815) internal successors, (5577), 1809 states have internal predecessors, (5577), 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-12-14 05:16:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 5577 transitions. [2022-12-14 05:16:07,241 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 5577 transitions. Word has length 25 [2022-12-14 05:16:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:16:07,241 INFO L495 AbstractCegarLoop]: Abstraction has 1810 states and 5577 transitions. [2022-12-14 05:16:07,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 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-12-14 05:16:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 5577 transitions. [2022-12-14 05:16:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 05:16:07,246 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:16:07,246 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 1, 1, 1, 1, 1, 1] [2022-12-14 05:16:07,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-12-14 05:16:07,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:16:07,447 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:16:07,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:16:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash -82360599, now seen corresponding path program 6 times [2022-12-14 05:16:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:16:07,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222637727] [2022-12-14 05:16:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:16:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:16:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:16:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:08,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:16:08,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222637727] [2022-12-14 05:16:08,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222637727] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:16:08,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726067743] [2022-12-14 05:16:08,122 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:16:08,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:16:08,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:16:08,123 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:16:08,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-14 05:16:08,304 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:16:08,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:16:08,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 05:16:08,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:16:08,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:16:08,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:16:08,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-14 05:16:08,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:16:08,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:16:08,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:16:08,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:16:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:08,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:16:08,881 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2415 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2415) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-12-14 05:16:08,934 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2415 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2415) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-12-14 05:16:08,940 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2415 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2415) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 12)) 9223372039002259456))) is different from false [2022-12-14 05:16:08,946 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2415 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2415) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 16)) 9223372039002259456))) is different from false [2022-12-14 05:16:08,952 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2415 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2415) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 20)) 9223372039002259456))) is different from false [2022-12-14 05:16:09,014 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2415 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2415) c_~A~0.base) (+ c_~A~0.offset 24)) 9223372039002259456))) is different from false [2022-12-14 05:16:09,185 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 05:16:09,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-12-14 05:16:09,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:16:09,191 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 81 treesize of output 77 [2022-12-14 05:16:09,194 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 62 treesize of output 54 [2022-12-14 05:16:09,198 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 28 treesize of output 24 [2022-12-14 05:16:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 32 not checked. [2022-12-14 05:16:09,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726067743] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:16:09,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [710252664] [2022-12-14 05:16:09,438 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-12-14 05:16:09,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:16:09,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2022-12-14 05:16:09,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183254040] [2022-12-14 05:16:09,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:16:09,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-14 05:16:09,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:16:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-14 05:16:09,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2268, Unknown=30, NotChecked=606, Total=3080 [2022-12-14 05:16:09,439 INFO L87 Difference]: Start difference. First operand 1810 states and 5577 transitions. Second operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 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-12-14 05:16:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:16:12,196 INFO L93 Difference]: Finished difference Result 2790 states and 7314 transitions. [2022-12-14 05:16:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 05:16:12,197 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 05:16:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:16:12,200 INFO L225 Difference]: With dead ends: 2790 [2022-12-14 05:16:12,200 INFO L226 Difference]: Without dead ends: 2790 [2022-12-14 05:16:12,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=409, Invalid=3875, Unknown=30, NotChecked=798, Total=5112 [2022-12-14 05:16:12,201 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 309 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 4793 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 5455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 631 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:16:12,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 364 Invalid, 5455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4793 Invalid, 0 Unknown, 631 Unchecked, 2.0s Time] [2022-12-14 05:16:12,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2022-12-14 05:16:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1810. [2022-12-14 05:16:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1786 states have (on average 3.0996640537514) internal successors, (5536), 1809 states have internal predecessors, (5536), 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-12-14 05:16:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 5536 transitions. [2022-12-14 05:16:12,222 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 5536 transitions. Word has length 26 [2022-12-14 05:16:12,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:16:12,222 INFO L495 AbstractCegarLoop]: Abstraction has 1810 states and 5536 transitions. [2022-12-14 05:16:12,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 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-12-14 05:16:12,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 5536 transitions. [2022-12-14 05:16:12,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 05:16:12,223 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:16:12,223 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1] [2022-12-14 05:16:12,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-12-14 05:16:12,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:16:12,424 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:16:12,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:16:12,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1398731158, now seen corresponding path program 10 times [2022-12-14 05:16:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:16:12,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29567788] [2022-12-14 05:16:12,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:16:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:16:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:16:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 36 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:12,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:16:12,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29567788] [2022-12-14 05:16:12,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29567788] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:16:12,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112731918] [2022-12-14 05:16:12,716 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:16:12,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:16:12,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:16:12,717 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:16:12,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-14 05:16:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:16:12,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 05:16:12,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:16:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:13,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:16:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:13,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112731918] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:16:13,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [395822959] [2022-12-14 05:16:13,289 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-12-14 05:16:13,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:16:13,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 42 [2022-12-14 05:16:13,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544549682] [2022-12-14 05:16:13,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:16:13,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-14 05:16:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:16:13,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-14 05:16:13,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=1425, Unknown=0, NotChecked=0, Total=1892 [2022-12-14 05:16:13,291 INFO L87 Difference]: Start difference. First operand 1810 states and 5536 transitions. Second operand has 44 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 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-12-14 05:16:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:16:13,903 INFO L93 Difference]: Finished difference Result 2204 states and 5969 transitions. [2022-12-14 05:16:13,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 05:16:13,904 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 05:16:13,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:16:13,907 INFO L225 Difference]: With dead ends: 2204 [2022-12-14 05:16:13,907 INFO L226 Difference]: Without dead ends: 2172 [2022-12-14 05:16:13,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=912, Invalid=2628, Unknown=0, NotChecked=0, Total=3540 [2022-12-14 05:16:13,907 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 263 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:16:13,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 102 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:16:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2022-12-14 05:16:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 1642. [2022-12-14 05:16:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1618 states have (on average 2.9629171817058095) internal successors, (4794), 1641 states have internal predecessors, (4794), 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-12-14 05:16:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 4794 transitions. [2022-12-14 05:16:13,928 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 4794 transitions. Word has length 26 [2022-12-14 05:16:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:16:13,929 INFO L495 AbstractCegarLoop]: Abstraction has 1642 states and 4794 transitions. [2022-12-14 05:16:13,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 43 states have internal predecessors, (63), 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-12-14 05:16:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 4794 transitions. [2022-12-14 05:16:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 05:16:13,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:16:13,930 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:16:13,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2022-12-14 05:16:14,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:16:14,131 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:16:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:16:14,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1302741068, now seen corresponding path program 11 times [2022-12-14 05:16:14,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:16:14,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777048087] [2022-12-14 05:16:14,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:16:14,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:16:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:16:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:14,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:16:14,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777048087] [2022-12-14 05:16:14,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777048087] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:16:14,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874349153] [2022-12-14 05:16:14,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:16:14,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:16:14,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:16:14,718 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:16:14,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-14 05:16:15,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-12-14 05:16:15,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:16:15,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 05:16:15,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:16:15,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:16:15,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:16:15,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:16:15,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:16:15,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:16:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:16,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:16:16,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:16:16,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:16:16,979 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:16:16,980 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 157 treesize of output 145 [2022-12-14 05:16:16,985 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 65 treesize of output 53 [2022-12-14 05:16:16,989 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 118 treesize of output 94 [2022-12-14 05:16:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:17,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874349153] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:16:17,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [541037361] [2022-12-14 05:16:17,667 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-12-14 05:16:17,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:16:17,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2022-12-14 05:16:17,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441585238] [2022-12-14 05:16:17,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:16:17,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-12-14 05:16:17,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:16:17,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-12-14 05:16:17,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2482, Unknown=2, NotChecked=0, Total=2756 [2022-12-14 05:16:17,668 INFO L87 Difference]: Start difference. First operand 1642 states and 4794 transitions. Second operand has 53 states, 52 states have (on average 1.5) internal successors, (78), 52 states have internal predecessors, (78), 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-12-14 05:16:19,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:16:53,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:16:53,957 INFO L93 Difference]: Finished difference Result 3448 states and 9487 transitions. [2022-12-14 05:16:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-12-14 05:16:53,957 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.5) internal successors, (78), 52 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 05:16:53,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:16:53,961 INFO L225 Difference]: With dead ends: 3448 [2022-12-14 05:16:53,961 INFO L226 Difference]: Without dead ends: 3448 [2022-12-14 05:16:53,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3301 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=1469, Invalid=12571, Unknown=2, NotChecked=0, Total=14042 [2022-12-14 05:16:53,962 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 1518 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 6343 mSolverCounterSat, 89 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 6433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 6343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:16:53,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 582 Invalid, 6433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 6343 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2022-12-14 05:16:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2022-12-14 05:16:53,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 2360. [2022-12-14 05:16:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2336 states have (on average 3.112585616438356) internal successors, (7271), 2359 states have internal predecessors, (7271), 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-12-14 05:16:53,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 7271 transitions. [2022-12-14 05:16:53,991 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 7271 transitions. Word has length 26 [2022-12-14 05:16:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:16:53,991 INFO L495 AbstractCegarLoop]: Abstraction has 2360 states and 7271 transitions. [2022-12-14 05:16:53,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.5) internal successors, (78), 52 states have internal predecessors, (78), 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-12-14 05:16:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 7271 transitions. [2022-12-14 05:16:53,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 05:16:53,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:16:53,993 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1] [2022-12-14 05:16:53,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-12-14 05:16:54,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-12-14 05:16:54,194 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:16:54,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:16:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1741702035, now seen corresponding path program 10 times [2022-12-14 05:16:54,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:16:54,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459058326] [2022-12-14 05:16:54,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:16:54,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:16:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:16:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:54,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:16:54,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459058326] [2022-12-14 05:16:54,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459058326] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:16:54,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858193631] [2022-12-14 05:16:54,731 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:16:54,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:16:54,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:16:54,732 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:16:54,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-14 05:16:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:16:54,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 05:16:54,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:16:55,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:16:55,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:16:55,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:16:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:55,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:16:55,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:16:55,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 05:16:55,745 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:16:55,745 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 43 treesize of output 39 [2022-12-14 05:16:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:55,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858193631] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:16:55,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1328580118] [2022-12-14 05:16:55,976 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-12-14 05:16:55,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:16:55,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2022-12-14 05:16:55,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579930302] [2022-12-14 05:16:55,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:16:55,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-14 05:16:55,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:16:55,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-14 05:16:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2904, Unknown=10, NotChecked=0, Total=3080 [2022-12-14 05:16:55,977 INFO L87 Difference]: Start difference. First operand 2360 states and 7271 transitions. Second operand has 56 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 55 states have internal predecessors, (81), 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-12-14 05:16:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:16:58,203 INFO L93 Difference]: Finished difference Result 3431 states and 10224 transitions. [2022-12-14 05:16:58,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 05:16:58,204 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 55 states have internal predecessors, (81), 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-12-14 05:16:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:16:58,209 INFO L225 Difference]: With dead ends: 3431 [2022-12-14 05:16:58,209 INFO L226 Difference]: Without dead ends: 3431 [2022-12-14 05:16:58,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=469, Invalid=6493, Unknown=10, NotChecked=0, Total=6972 [2022-12-14 05:16:58,209 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 202 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2850 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:16:58,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 101 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2850 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 05:16:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2022-12-14 05:16:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 2364. [2022-12-14 05:16:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 2340 states have (on average 3.1123931623931624) internal successors, (7283), 2363 states have internal predecessors, (7283), 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-12-14 05:16:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 7283 transitions. [2022-12-14 05:16:58,245 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 7283 transitions. Word has length 27 [2022-12-14 05:16:58,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:16:58,245 INFO L495 AbstractCegarLoop]: Abstraction has 2364 states and 7283 transitions. [2022-12-14 05:16:58,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 55 states have internal predecessors, (81), 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-12-14 05:16:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 7283 transitions. [2022-12-14 05:16:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 05:16:58,246 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:16:58,246 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1] [2022-12-14 05:16:58,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-12-14 05:16:58,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-12-14 05:16:58,448 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:16:58,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:16:58,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1741702036, now seen corresponding path program 11 times [2022-12-14 05:16:58,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:16:58,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290392413] [2022-12-14 05:16:58,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:16:58,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:16:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:16:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:16:59,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:16:59,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290392413] [2022-12-14 05:16:59,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290392413] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:16:59,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808123405] [2022-12-14 05:16:59,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:16:59,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:16:59,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:16:59,016 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:16:59,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-14 05:16:59,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-12-14 05:16:59,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:16:59,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 05:16:59,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:16:59,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:16:59,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:16:59,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:17:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 49 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:00,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:17:00,942 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:17:00,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 05:17:00,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:17:00,948 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 41 treesize of output 37 [2022-12-14 05:17:00,951 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 13 treesize of output 7 [2022-12-14 05:17:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 42 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:01,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808123405] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:17:01,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1247853679] [2022-12-14 05:17:01,549 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-12-14 05:17:01,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:17:01,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2022-12-14 05:17:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614139683] [2022-12-14 05:17:01,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:17:01,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-14 05:17:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:17:01,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-14 05:17:01,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=2759, Unknown=0, NotChecked=0, Total=3080 [2022-12-14 05:17:01,550 INFO L87 Difference]: Start difference. First operand 2364 states and 7283 transitions. Second operand has 56 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 55 states have internal predecessors, (81), 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-12-14 05:17:02,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:17:20,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:17:23,352 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 [0] [2022-12-14 05:17:25,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:17:25,717 INFO L93 Difference]: Finished difference Result 5970 states and 16270 transitions. [2022-12-14 05:17:25,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2022-12-14 05:17:25,718 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 55 states have internal predecessors, (81), 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-12-14 05:17:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:17:25,726 INFO L225 Difference]: With dead ends: 5970 [2022-12-14 05:17:25,726 INFO L226 Difference]: Without dead ends: 5970 [2022-12-14 05:17:25,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9787 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=3668, Invalid=30004, Unknown=0, NotChecked=0, Total=33672 [2022-12-14 05:17:25,727 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 696 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 5469 mSolverCounterSat, 79 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 5551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 5469 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:17:25,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 209 Invalid, 5551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 5469 Invalid, 3 Unknown, 0 Unchecked, 10.8s Time] [2022-12-14 05:17:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5970 states. [2022-12-14 05:17:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5970 to 2968. [2022-12-14 05:17:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2968 states, 2944 states have (on average 3.2119565217391304) internal successors, (9456), 2967 states have internal predecessors, (9456), 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-12-14 05:17:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 9456 transitions. [2022-12-14 05:17:25,782 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 9456 transitions. Word has length 27 [2022-12-14 05:17:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:17:25,782 INFO L495 AbstractCegarLoop]: Abstraction has 2968 states and 9456 transitions. [2022-12-14 05:17:25,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 55 states have internal predecessors, (81), 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-12-14 05:17:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 9456 transitions. [2022-12-14 05:17:25,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 05:17:25,784 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:17:25,784 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:17:25,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-12-14 05:17:25,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:17:25,985 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:17:25,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:17:25,986 INFO L85 PathProgramCache]: Analyzing trace with hash 148206967, now seen corresponding path program 6 times [2022-12-14 05:17:25,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:17:25,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174334750] [2022-12-14 05:17:25,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:17:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:17:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:17:26,547 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:26,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:17:26,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174334750] [2022-12-14 05:17:26,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174334750] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:17:26,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843397066] [2022-12-14 05:17:26,548 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:17:26,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:17:26,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:17:26,549 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:17:26,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-14 05:17:26,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:17:26,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:17:26,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 05:17:26,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:17:26,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:17:27,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:17:27,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-14 05:17:27,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:17:27,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:17:27,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:17:27,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:17:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:27,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:17:27,853 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 05:17:27,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-12-14 05:17:27,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:17:27,862 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 159 treesize of output 149 [2022-12-14 05:17:27,865 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 134 treesize of output 126 [2022-12-14 05:17:27,869 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 126 treesize of output 110 [2022-12-14 05:17:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:28,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843397066] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:17:28,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [888557766] [2022-12-14 05:17:28,157 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-12-14 05:17:28,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:17:28,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2022-12-14 05:17:28,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323661562] [2022-12-14 05:17:28,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:17:28,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-14 05:17:28,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:17:28,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-14 05:17:28,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2667, Unknown=17, NotChecked=0, Total=2862 [2022-12-14 05:17:28,159 INFO L87 Difference]: Start difference. First operand 2968 states and 9456 transitions. Second operand has 54 states, 53 states have (on average 1.471698113207547) internal successors, (78), 53 states have internal predecessors, (78), 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-12-14 05:17:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:17:31,502 INFO L93 Difference]: Finished difference Result 3742 states and 11096 transitions. [2022-12-14 05:17:31,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 05:17:31,502 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.471698113207547) internal successors, (78), 53 states have internal predecessors, (78), 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-12-14 05:17:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:17:31,507 INFO L225 Difference]: With dead ends: 3742 [2022-12-14 05:17:31,507 INFO L226 Difference]: Without dead ends: 3742 [2022-12-14 05:17:31,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=462, Invalid=4351, Unknown=17, NotChecked=0, Total=4830 [2022-12-14 05:17:31,508 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 540 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 4689 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 4713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:17:31,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 381 Invalid, 4713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4689 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-12-14 05:17:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2022-12-14 05:17:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3238. [2022-12-14 05:17:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3238 states, 3214 states have (on average 3.195395146235221) internal successors, (10270), 3237 states have internal predecessors, (10270), 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-12-14 05:17:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3238 states to 3238 states and 10270 transitions. [2022-12-14 05:17:31,549 INFO L78 Accepts]: Start accepts. Automaton has 3238 states and 10270 transitions. Word has length 27 [2022-12-14 05:17:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:17:31,550 INFO L495 AbstractCegarLoop]: Abstraction has 3238 states and 10270 transitions. [2022-12-14 05:17:31,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.471698113207547) internal successors, (78), 53 states have internal predecessors, (78), 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-12-14 05:17:31,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3238 states and 10270 transitions. [2022-12-14 05:17:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 05:17:31,551 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:17:31,551 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1] [2022-12-14 05:17:31,556 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-12-14 05:17:31,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-12-14 05:17:31,752 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:17:31,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:17:31,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1841808059, now seen corresponding path program 7 times [2022-12-14 05:17:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:17:31,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525939806] [2022-12-14 05:17:31,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:17:31,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:17:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:17:32,394 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:32,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:17:32,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525939806] [2022-12-14 05:17:32,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525939806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:17:32,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159627711] [2022-12-14 05:17:32,394 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:17:32,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:17:32,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:17:32,395 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:17:32,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-12-14 05:17:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:17:32,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-14 05:17:32,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:17:32,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:17:32,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:17:32,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:17:33,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:17:33,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:17:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:33,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:17:33,420 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2763 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2763) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-12-14 05:17:33,426 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2763 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2763) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-12-14 05:17:33,624 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2763 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2763) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 24)) 9223372039002259456))) is different from false [2022-12-14 05:17:33,630 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2763 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2763) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 28)) 9223372039002259456))) is different from false [2022-12-14 05:17:33,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:17:33,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:17:33,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:17:33,789 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 81 treesize of output 77 [2022-12-14 05:17:33,793 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 32 treesize of output 28 [2022-12-14 05:17:33,795 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 58 treesize of output 50 [2022-12-14 05:17:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 40 not checked. [2022-12-14 05:17:34,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159627711] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:17:34,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1256983300] [2022-12-14 05:17:34,152 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-12-14 05:17:34,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:17:34,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2022-12-14 05:17:34,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068047837] [2022-12-14 05:17:34,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:17:34,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-14 05:17:34,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:17:34,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-14 05:17:34,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2770, Unknown=49, NotChecked=436, Total=3422 [2022-12-14 05:17:34,153 INFO L87 Difference]: Start difference. First operand 3238 states and 10270 transitions. Second operand has 59 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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-12-14 05:17:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:17:40,308 INFO L93 Difference]: Finished difference Result 5075 states and 14282 transitions. [2022-12-14 05:17:40,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 05:17:40,308 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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-12-14 05:17:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:17:40,315 INFO L225 Difference]: With dead ends: 5075 [2022-12-14 05:17:40,315 INFO L226 Difference]: Without dead ends: 5075 [2022-12-14 05:17:40,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 85 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=475, Invalid=6295, Unknown=52, NotChecked=660, Total=7482 [2022-12-14 05:17:40,316 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 719 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 7654 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 8341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 7654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 630 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:17:40,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 620 Invalid, 8341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 7654 Invalid, 0 Unknown, 630 Unchecked, 3.6s Time] [2022-12-14 05:17:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5075 states. [2022-12-14 05:17:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5075 to 3484. [2022-12-14 05:17:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3460 states have (on average 3.2439306358381503) internal successors, (11224), 3483 states have internal predecessors, (11224), 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-12-14 05:17:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 11224 transitions. [2022-12-14 05:17:40,365 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 11224 transitions. Word has length 28 [2022-12-14 05:17:40,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:17:40,365 INFO L495 AbstractCegarLoop]: Abstraction has 3484 states and 11224 transitions. [2022-12-14 05:17:40,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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-12-14 05:17:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 11224 transitions. [2022-12-14 05:17:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 05:17:40,367 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:17:40,367 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1] [2022-12-14 05:17:40,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-12-14 05:17:40,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:17:40,568 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:17:40,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:17:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1841808058, now seen corresponding path program 7 times [2022-12-14 05:17:40,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:17:40,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93222282] [2022-12-14 05:17:40,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:17:40,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:17:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:17:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:41,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:17:41,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93222282] [2022-12-14 05:17:41,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93222282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:17:41,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530487380] [2022-12-14 05:17:41,331 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:17:41,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:17:41,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:17:41,332 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:17:41,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-12-14 05:17:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:17:41,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-14 05:17:41,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:17:41,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:17:41,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:17:41,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:17:42,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:17:42,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:17:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:42,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:17:42,528 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2825 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2825) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 4294967296)) is different from false [2022-12-14 05:17:42,604 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2825 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2825) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 16)) 4294967296)) is different from false [2022-12-14 05:17:42,611 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2825 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2825) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 20)) 4294967296)) is different from false [2022-12-14 05:17:42,617 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2825 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2825) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 24)) 4294967296)) is different from false [2022-12-14 05:17:42,623 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2825 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2825) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 28)) 4294967296)) is different from false [2022-12-14 05:17:42,629 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2825 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2825) c_~A~0.base) (+ c_~A~0.offset 28)) 4294967296)) is different from false [2022-12-14 05:17:42,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:17:42,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:17:42,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:17:42,752 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 141 treesize of output 131 [2022-12-14 05:17:42,756 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 59 treesize of output 51 [2022-12-14 05:17:42,760 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 110 treesize of output 94 [2022-12-14 05:17:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 45 not checked. [2022-12-14 05:17:43,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530487380] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:17:43,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [351564130] [2022-12-14 05:17:43,159 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-12-14 05:17:43,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:17:43,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2022-12-14 05:17:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448250143] [2022-12-14 05:17:43,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:17:43,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-14 05:17:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:17:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-14 05:17:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2585, Unknown=40, NotChecked=642, Total=3422 [2022-12-14 05:17:43,161 INFO L87 Difference]: Start difference. First operand 3484 states and 11224 transitions. Second operand has 59 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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-12-14 05:17:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:17:50,593 INFO L93 Difference]: Finished difference Result 4995 states and 14004 transitions. [2022-12-14 05:17:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 05:17:50,594 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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-12-14 05:17:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:17:50,601 INFO L225 Difference]: With dead ends: 4995 [2022-12-14 05:17:50,601 INFO L226 Difference]: Without dead ends: 4995 [2022-12-14 05:17:50,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 85 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=443, Invalid=6019, Unknown=42, NotChecked=978, Total=7482 [2022-12-14 05:17:50,601 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 715 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 7865 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 9121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 7865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1201 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:17:50,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 637 Invalid, 9121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 7865 Invalid, 0 Unknown, 1201 Unchecked, 4.6s Time] [2022-12-14 05:17:50,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2022-12-14 05:17:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 3484. [2022-12-14 05:17:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3460 states have (on average 3.208381502890173) internal successors, (11101), 3483 states have internal predecessors, (11101), 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-12-14 05:17:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 11101 transitions. [2022-12-14 05:17:50,646 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 11101 transitions. Word has length 28 [2022-12-14 05:17:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:17:50,646 INFO L495 AbstractCegarLoop]: Abstraction has 3484 states and 11101 transitions. [2022-12-14 05:17:50,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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-12-14 05:17:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 11101 transitions. [2022-12-14 05:17:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 05:17:50,647 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:17:50,648 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1] [2022-12-14 05:17:50,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-12-14 05:17:50,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-12-14 05:17:50,849 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:17:50,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:17:50,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1261561673, now seen corresponding path program 11 times [2022-12-14 05:17:50,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:17:50,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471749802] [2022-12-14 05:17:50,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:17:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:17:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:17:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:51,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:17:51,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471749802] [2022-12-14 05:17:51,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471749802] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:17:51,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069728320] [2022-12-14 05:17:51,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:17:51,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:17:51,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:17:51,104 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:17:51,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-12-14 05:17:51,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-12-14 05:17:51,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:17:51,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 05:17:51,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:17:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 64 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:52,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:17:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 64 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:52,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069728320] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:17:52,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [438609227] [2022-12-14 05:17:52,474 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-12-14 05:17:52,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:17:52,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2022-12-14 05:17:52,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833793907] [2022-12-14 05:17:52,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:17:52,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-14 05:17:52,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:17:52,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-14 05:17:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=1778, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 05:17:52,476 INFO L87 Difference]: Start difference. First operand 3484 states and 11101 transitions. Second operand has 49 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 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-12-14 05:17:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:17:54,340 INFO L93 Difference]: Finished difference Result 4597 states and 12398 transitions. [2022-12-14 05:17:54,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-14 05:17:54,341 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 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 29 [2022-12-14 05:17:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:17:54,347 INFO L225 Difference]: With dead ends: 4597 [2022-12-14 05:17:54,347 INFO L226 Difference]: Without dead ends: 4529 [2022-12-14 05:17:54,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2369 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1773, Invalid=5199, Unknown=0, NotChecked=0, Total=6972 [2022-12-14 05:17:54,347 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 437 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:17:54,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 231 Invalid, 2486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2478 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 05:17:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2022-12-14 05:17:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 2653. [2022-12-14 05:17:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2653 states, 2629 states have (on average 2.9425637124381896) internal successors, (7736), 2652 states have internal predecessors, (7736), 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-12-14 05:17:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2653 states and 7736 transitions. [2022-12-14 05:17:54,390 INFO L78 Accepts]: Start accepts. Automaton has 2653 states and 7736 transitions. Word has length 29 [2022-12-14 05:17:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:17:54,391 INFO L495 AbstractCegarLoop]: Abstraction has 2653 states and 7736 transitions. [2022-12-14 05:17:54,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 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-12-14 05:17:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2653 states and 7736 transitions. [2022-12-14 05:17:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 05:17:54,392 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:17:54,392 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:17:54,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-12-14 05:17:54,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2022-12-14 05:17:54,593 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:17:54,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:17:54,594 INFO L85 PathProgramCache]: Analyzing trace with hash 693001431, now seen corresponding path program 7 times [2022-12-14 05:17:54,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:17:54,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123144828] [2022-12-14 05:17:54,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:17:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:17:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:17:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:55,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:17:55,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123144828] [2022-12-14 05:17:55,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123144828] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:17:55,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926685618] [2022-12-14 05:17:55,259 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:17:55,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:17:55,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:17:55,260 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:17:55,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-12-14 05:17:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:17:55,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-14 05:17:55,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:17:55,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:17:55,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:17:55,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:17:55,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:17:55,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:17:56,205 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:56,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:17:56,496 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2941 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2941) c_~A~0.base) (+ c_~A~0.offset 28)) 4294967296))) is different from false [2022-12-14 05:17:56,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:17:56,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:17:56,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:17:56,582 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 81 treesize of output 77 [2022-12-14 05:17:56,585 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 32 treesize of output 28 [2022-12-14 05:17:56,588 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 58 treesize of output 50 [2022-12-14 05:17:56,922 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:17:56,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926685618] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:17:56,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1555759902] [2022-12-14 05:17:56,923 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-12-14 05:17:56,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:17:56,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2022-12-14 05:17:56,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915682753] [2022-12-14 05:17:56,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:17:56,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-14 05:17:56,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:17:56,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-14 05:17:56,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3126, Unknown=7, NotChecked=112, Total=3422 [2022-12-14 05:17:56,925 INFO L87 Difference]: Start difference. First operand 2653 states and 7736 transitions. Second operand has 59 states, 58 states have (on average 1.5) internal successors, (87), 58 states have internal predecessors, (87), 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-12-14 05:18:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:18:01,992 INFO L93 Difference]: Finished difference Result 3285 states and 9042 transitions. [2022-12-14 05:18:01,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 05:18:01,992 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.5) internal successors, (87), 58 states have internal predecessors, (87), 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 29 [2022-12-14 05:18:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:18:01,996 INFO L225 Difference]: With dead ends: 3285 [2022-12-14 05:18:01,996 INFO L226 Difference]: Without dead ends: 3285 [2022-12-14 05:18:01,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=516, Invalid=6791, Unknown=7, NotChecked=168, Total=7482 [2022-12-14 05:18:01,996 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 658 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 7579 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 7716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:18:01,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 658 Invalid, 7716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7579 Invalid, 0 Unknown, 113 Unchecked, 3.3s Time] [2022-12-14 05:18:01,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2022-12-14 05:18:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 2833. [2022-12-14 05:18:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2833 states, 2809 states have (on average 2.968316126735493) internal successors, (8338), 2832 states have internal predecessors, (8338), 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-12-14 05:18:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2833 states to 2833 states and 8338 transitions. [2022-12-14 05:18:02,026 INFO L78 Accepts]: Start accepts. Automaton has 2833 states and 8338 transitions. Word has length 29 [2022-12-14 05:18:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:18:02,027 INFO L495 AbstractCegarLoop]: Abstraction has 2833 states and 8338 transitions. [2022-12-14 05:18:02,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.5) internal successors, (87), 58 states have internal predecessors, (87), 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-12-14 05:18:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2833 states and 8338 transitions. [2022-12-14 05:18:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 05:18:02,028 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:18:02,028 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:18:02,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-12-14 05:18:02,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,64 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:18:02,229 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:18:02,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:18:02,230 INFO L85 PathProgramCache]: Analyzing trace with hash 635535026, now seen corresponding path program 1 times [2022-12-14 05:18:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:18:02,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388525532] [2022-12-14 05:18:02,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:18:02,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:18:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:18:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 05:18:02,378 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:18:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388525532] [2022-12-14 05:18:02,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388525532] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:18:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22041249] [2022-12-14 05:18:02,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:18:02,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:18:02,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:18:02,379 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:18:02,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-12-14 05:18:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:18:02,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 05:18:02,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:18:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:02,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:18:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:03,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22041249] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:18:03,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [278589625] [2022-12-14 05:18:03,144 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-12-14 05:18:03,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:18:03,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 43 [2022-12-14 05:18:03,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895601238] [2022-12-14 05:18:03,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:18:03,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 05:18:03,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:18:03,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 05:18:03,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1431, Unknown=0, NotChecked=0, Total=1806 [2022-12-14 05:18:03,145 INFO L87 Difference]: Start difference. First operand 2833 states and 8338 transitions. Second operand has 43 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 43 states have internal predecessors, (77), 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-12-14 05:18:03,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:18:03,895 INFO L93 Difference]: Finished difference Result 3213 states and 8804 transitions. [2022-12-14 05:18:03,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 05:18:03,895 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 43 states have internal predecessors, (77), 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 29 [2022-12-14 05:18:03,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:18:03,899 INFO L225 Difference]: With dead ends: 3213 [2022-12-14 05:18:03,899 INFO L226 Difference]: Without dead ends: 2602 [2022-12-14 05:18:03,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=817, Invalid=2723, Unknown=0, NotChecked=0, Total=3540 [2022-12-14 05:18:03,899 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 788 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:18:03,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 100 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 05:18:03,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2022-12-14 05:18:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2184. [2022-12-14 05:18:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 2160 states have (on average 3.009259259259259) internal successors, (6500), 2183 states have internal predecessors, (6500), 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-12-14 05:18:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 6500 transitions. [2022-12-14 05:18:03,923 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 6500 transitions. Word has length 29 [2022-12-14 05:18:03,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:18:03,923 INFO L495 AbstractCegarLoop]: Abstraction has 2184 states and 6500 transitions. [2022-12-14 05:18:03,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 43 states have internal predecessors, (77), 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-12-14 05:18:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 6500 transitions. [2022-12-14 05:18:03,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 05:18:03,924 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:18:03,924 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1] [2022-12-14 05:18:03,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-12-14 05:18:04,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,65 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:18:04,125 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:18:04,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:18:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1888887987, now seen corresponding path program 12 times [2022-12-14 05:18:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:18:04,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957079591] [2022-12-14 05:18:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:18:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:18:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:18:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:04,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:18:04,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957079591] [2022-12-14 05:18:04,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957079591] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:18:04,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077860428] [2022-12-14 05:18:04,826 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:18:04,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:18:04,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:18:04,827 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:18:04,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-12-14 05:18:05,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:18:05,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:18:05,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 05:18:05,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:18:05,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:18:05,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:18:05,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:18:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:05,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:18:05,836 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3056 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3056) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-12-14 05:18:05,841 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:18:05,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-12-14 05:18:05,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:18:05,845 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 43 treesize of output 39 [2022-12-14 05:18:05,853 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 9 treesize of output 5 [2022-12-14 05:18:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-14 05:18:06,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077860428] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:18:06,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1573666544] [2022-12-14 05:18:06,115 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-12-14 05:18:06,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:18:06,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 58 [2022-12-14 05:18:06,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855600927] [2022-12-14 05:18:06,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:18:06,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-12-14 05:18:06,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:18:06,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-12-14 05:18:06,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3236, Unknown=1, NotChecked=114, Total=3540 [2022-12-14 05:18:06,116 INFO L87 Difference]: Start difference. First operand 2184 states and 6500 transitions. Second operand has 60 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 59 states have internal predecessors, (87), 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-12-14 05:18:08,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:18:08,263 INFO L93 Difference]: Finished difference Result 3158 states and 9057 transitions. [2022-12-14 05:18:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 05:18:08,264 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 59 states have internal predecessors, (87), 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-12-14 05:18:08,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:18:08,268 INFO L225 Difference]: With dead ends: 3158 [2022-12-14 05:18:08,268 INFO L226 Difference]: Without dead ends: 3158 [2022-12-14 05:18:08,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=413, Invalid=5910, Unknown=1, NotChecked=156, Total=6480 [2022-12-14 05:18:08,269 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 148 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 3929 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 4061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:18:08,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 160 Invalid, 4061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3929 Invalid, 0 Unknown, 124 Unchecked, 1.5s Time] [2022-12-14 05:18:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3158 states. [2022-12-14 05:18:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3158 to 2188. [2022-12-14 05:18:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2188 states, 2164 states have (on average 3.008780036968577) internal successors, (6511), 2187 states have internal predecessors, (6511), 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-12-14 05:18:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 6511 transitions. [2022-12-14 05:18:08,299 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 6511 transitions. Word has length 30 [2022-12-14 05:18:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:18:08,299 INFO L495 AbstractCegarLoop]: Abstraction has 2188 states and 6511 transitions. [2022-12-14 05:18:08,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 59 states have internal predecessors, (87), 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-12-14 05:18:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 6511 transitions. [2022-12-14 05:18:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 05:18:08,300 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:18:08,300 INFO L195 NwaCegarLoop]: trace histogram [9, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:18:08,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-12-14 05:18:08,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,66 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:18:08,501 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:18:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:18:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash 65675116, now seen corresponding path program 12 times [2022-12-14 05:18:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:18:08,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831568077] [2022-12-14 05:18:08,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:18:08,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:18:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:18:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:09,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:18:09,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831568077] [2022-12-14 05:18:09,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831568077] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:18:09,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149322961] [2022-12-14 05:18:09,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:18:09,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:18:09,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:18:09,187 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:18:09,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-12-14 05:18:09,463 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:18:09,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:18:09,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-14 05:18:09,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:18:09,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:18:09,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:18:09,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 05:18:09,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:18:09,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:18:09,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:18:09,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:18:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:10,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:18:10,629 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 05:18:10,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-12-14 05:18:10,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:18:10,636 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 71 treesize of output 67 [2022-12-14 05:18:10,638 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 54 treesize of output 46 [2022-12-14 05:18:10,641 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 24 treesize of output 20 [2022-12-14 05:18:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:10,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149322961] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:18:10,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1249048742] [2022-12-14 05:18:10,991 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-12-14 05:18:10,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:18:10,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 58 [2022-12-14 05:18:10,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018133095] [2022-12-14 05:18:10,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:18:10,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-12-14 05:18:10,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:18:10,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-12-14 05:18:10,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3324, Unknown=18, NotChecked=0, Total=3540 [2022-12-14 05:18:10,992 INFO L87 Difference]: Start difference. First operand 2188 states and 6511 transitions. Second operand has 60 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 59 states have internal predecessors, (87), 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-12-14 05:18:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:18:14,489 INFO L93 Difference]: Finished difference Result 2556 states and 7013 transitions. [2022-12-14 05:18:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 05:18:14,489 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 59 states have internal predecessors, (87), 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-12-14 05:18:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:18:14,493 INFO L225 Difference]: With dead ends: 2556 [2022-12-14 05:18:14,493 INFO L226 Difference]: Without dead ends: 2556 [2022-12-14 05:18:14,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=519, Invalid=5469, Unknown=18, NotChecked=0, Total=6006 [2022-12-14 05:18:14,493 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 360 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 5702 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 5715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 5702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:18:14,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 459 Invalid, 5715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 5702 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 05:18:14,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-12-14 05:18:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2188. [2022-12-14 05:18:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2188 states, 2164 states have (on average 2.9856746765249538) internal successors, (6461), 2187 states have internal predecessors, (6461), 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-12-14 05:18:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 6461 transitions. [2022-12-14 05:18:14,516 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 6461 transitions. Word has length 30 [2022-12-14 05:18:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:18:14,516 INFO L495 AbstractCegarLoop]: Abstraction has 2188 states and 6461 transitions. [2022-12-14 05:18:14,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 59 states have internal predecessors, (87), 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-12-14 05:18:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 6461 transitions. [2022-12-14 05:18:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 05:18:14,517 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:18:14,517 INFO L195 NwaCegarLoop]: trace histogram [10, 8, 8, 1, 1, 1, 1, 1] [2022-12-14 05:18:14,522 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-12-14 05:18:14,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,67 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:18:14,718 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:18:14,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:18:14,719 INFO L85 PathProgramCache]: Analyzing trace with hash 138832760, now seen corresponding path program 12 times [2022-12-14 05:18:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:18:14,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638308303] [2022-12-14 05:18:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:18:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:18:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:18:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:15,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:18:15,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638308303] [2022-12-14 05:18:15,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638308303] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:18:15,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793588194] [2022-12-14 05:18:15,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:18:15,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:18:15,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:18:15,430 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:18:15,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-12-14 05:18:15,634 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:18:15,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:18:15,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 05:18:15,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:18:15,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:18:15,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:18:15,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 05:18:16,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:18:16,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:18:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:16,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:18:16,693 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 05:18:16,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-12-14 05:18:16,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:18:16,698 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 37 treesize of output 33 [2022-12-14 05:18:16,705 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 7 treesize of output 3 [2022-12-14 05:18:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:17,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793588194] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:18:17,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [377263642] [2022-12-14 05:18:17,046 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-12-14 05:18:17,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:18:17,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2022-12-14 05:18:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399833133] [2022-12-14 05:18:17,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:18:17,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-12-14 05:18:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:18:17,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-12-14 05:18:17,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3674, Unknown=26, NotChecked=0, Total=3906 [2022-12-14 05:18:17,048 INFO L87 Difference]: Start difference. First operand 2188 states and 6461 transitions. Second operand has 63 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 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-12-14 05:18:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:18:19,432 INFO L93 Difference]: Finished difference Result 3157 states and 8981 transitions. [2022-12-14 05:18:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 05:18:19,433 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 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 31 [2022-12-14 05:18:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:18:19,441 INFO L225 Difference]: With dead ends: 3157 [2022-12-14 05:18:19,441 INFO L226 Difference]: Without dead ends: 3157 [2022-12-14 05:18:19,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=510, Invalid=6436, Unknown=26, NotChecked=0, Total=6972 [2022-12-14 05:18:19,441 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 169 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 3536 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:18:19,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 119 Invalid, 3544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3536 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 05:18:19,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3157 states. [2022-12-14 05:18:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3157 to 2188. [2022-12-14 05:18:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2188 states, 2164 states have (on average 2.985212569316081) internal successors, (6460), 2187 states have internal predecessors, (6460), 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-12-14 05:18:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 6460 transitions. [2022-12-14 05:18:19,467 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 6460 transitions. Word has length 31 [2022-12-14 05:18:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:18:19,467 INFO L495 AbstractCegarLoop]: Abstraction has 2188 states and 6460 transitions. [2022-12-14 05:18:19,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 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-12-14 05:18:19,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 6460 transitions. [2022-12-14 05:18:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 05:18:19,468 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:18:19,468 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1] [2022-12-14 05:18:19,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-12-14 05:18:19,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2022-12-14 05:18:19,670 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:18:19,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:18:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1574018251, now seen corresponding path program 8 times [2022-12-14 05:18:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:18:19,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361201853] [2022-12-14 05:18:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:18:19,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:18:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:18:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:20,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:18:20,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361201853] [2022-12-14 05:18:20,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361201853] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:18:20,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257084956] [2022-12-14 05:18:20,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:18:20,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:18:20,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:18:20,471 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:18:20,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-12-14 05:18:21,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-12-14 05:18:21,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:18:21,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 05:18:21,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:18:21,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:18:21,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:18:21,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:18:22,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:18:22,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:18:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 56 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:22,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:18:25,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:18:25,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-12-14 05:18:25,183 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:18:25,183 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 175 treesize of output 163 [2022-12-14 05:18:25,188 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 73 treesize of output 61 [2022-12-14 05:18:25,192 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 134 treesize of output 110 [2022-12-14 05:18:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 56 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:18:26,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257084956] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:18:26,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [185988390] [2022-12-14 05:18:26,057 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-12-14 05:18:26,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:18:26,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2022-12-14 05:18:26,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471609503] [2022-12-14 05:18:26,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:18:26,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-14 05:18:26,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:18:26,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-14 05:18:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=3743, Unknown=10, NotChecked=0, Total=4160 [2022-12-14 05:18:26,058 INFO L87 Difference]: Start difference. First operand 2188 states and 6460 transitions. Second operand has 65 states, 64 states have (on average 1.453125) internal successors, (93), 64 states have internal predecessors, (93), 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-12-14 05:18:27,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:19:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:05,512 INFO L93 Difference]: Finished difference Result 8127 states and 20651 transitions. [2022-12-14 05:19:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-12-14 05:19:05,513 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.453125) internal successors, (93), 64 states have internal predecessors, (93), 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-12-14 05:19:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:05,523 INFO L225 Difference]: With dead ends: 8127 [2022-12-14 05:19:05,523 INFO L226 Difference]: Without dead ends: 8127 [2022-12-14 05:19:05,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8566 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=3199, Invalid=29371, Unknown=10, NotChecked=0, Total=32580 [2022-12-14 05:19:05,524 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 3378 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 16292 mSolverCounterSat, 374 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3378 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 16667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 16292 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:05,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3378 Valid, 1503 Invalid, 16667 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [374 Valid, 16292 Invalid, 1 Unknown, 0 Unchecked, 17.7s Time] [2022-12-14 05:19:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8127 states. [2022-12-14 05:19:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8127 to 4122. [2022-12-14 05:19:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4122 states, 4098 states have (on average 3.1930209858467546) internal successors, (13085), 4121 states have internal predecessors, (13085), 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-12-14 05:19:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4122 states to 4122 states and 13085 transitions. [2022-12-14 05:19:05,589 INFO L78 Accepts]: Start accepts. Automaton has 4122 states and 13085 transitions. Word has length 31 [2022-12-14 05:19:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:05,589 INFO L495 AbstractCegarLoop]: Abstraction has 4122 states and 13085 transitions. [2022-12-14 05:19:05,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.453125) internal successors, (93), 64 states have internal predecessors, (93), 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-12-14 05:19:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states and 13085 transitions. [2022-12-14 05:19:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 05:19:05,591 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:05,591 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:05,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-12-14 05:19:05,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-12-14 05:19:05,792 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:19:05,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:05,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1574018252, now seen corresponding path program 8 times [2022-12-14 05:19:05,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:05,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792571320] [2022-12-14 05:19:05,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:05,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:06,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:06,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792571320] [2022-12-14 05:19:06,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792571320] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:19:06,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876062032] [2022-12-14 05:19:06,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:19:06,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:06,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:19:06,537 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:19:06,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-12-14 05:19:07,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-12-14 05:19:07,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:19:07,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 05:19:07,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:19:07,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:19:07,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:07,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:19:07,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:07,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:19:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:07,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:19:07,908 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3323) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 4294967296)) is different from false [2022-12-14 05:19:07,913 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3323) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 4294967296)) is different from false [2022-12-14 05:19:07,917 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3323) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 12)) 4294967296)) is different from false [2022-12-14 05:19:07,922 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3323) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 16)) 4294967296)) is different from false [2022-12-14 05:19:07,996 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3323) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 24)) 4294967296)) is different from false [2022-12-14 05:19:08,002 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3323) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 28)) 4294967296)) is different from false [2022-12-14 05:19:08,007 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3323) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 32)) 4294967296)) is different from false [2022-12-14 05:19:08,012 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3323) c_~A~0.base) (+ c_~A~0.offset 32)) 4294967296)) is different from false [2022-12-14 05:19:08,018 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3322 (Array Int Int)) (v_ArrVal_3323 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3322) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3323) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 05:19:08,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:19:08,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:19:08,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:19:08,028 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 71 treesize of output 67 [2022-12-14 05:19:08,032 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 28 treesize of output 24 [2022-12-14 05:19:08,034 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 50 treesize of output 42 [2022-12-14 05:19:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 72 not checked. [2022-12-14 05:19:08,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876062032] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:19:08,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1501126728] [2022-12-14 05:19:08,414 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-12-14 05:19:08,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:19:08,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2022-12-14 05:19:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878266236] [2022-12-14 05:19:08,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:19:08,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-14 05:19:08,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:08,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-14 05:19:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2892, Unknown=27, NotChecked=1044, Total=4160 [2022-12-14 05:19:08,416 INFO L87 Difference]: Start difference. First operand 4122 states and 13085 transitions. Second operand has 65 states, 64 states have (on average 1.453125) internal successors, (93), 64 states have internal predecessors, (93), 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-12-14 05:19:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:14,412 INFO L93 Difference]: Finished difference Result 5585 states and 16192 transitions. [2022-12-14 05:19:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-14 05:19:14,412 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.453125) internal successors, (93), 64 states have internal predecessors, (93), 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-12-14 05:19:14,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:14,420 INFO L225 Difference]: With dead ends: 5585 [2022-12-14 05:19:14,420 INFO L226 Difference]: Without dead ends: 5585 [2022-12-14 05:19:14,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=423, Invalid=5438, Unknown=27, NotChecked=1422, Total=7310 [2022-12-14 05:19:14,421 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 575 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 8878 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 11350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 8878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2420 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:14,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 702 Invalid, 11350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 8878 Invalid, 0 Unknown, 2420 Unchecked, 4.7s Time] [2022-12-14 05:19:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5585 states. [2022-12-14 05:19:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5585 to 4367. [2022-12-14 05:19:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4367 states, 4343 states have (on average 3.1821321667050424) internal successors, (13820), 4366 states have internal predecessors, (13820), 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-12-14 05:19:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4367 states to 4367 states and 13820 transitions. [2022-12-14 05:19:14,483 INFO L78 Accepts]: Start accepts. Automaton has 4367 states and 13820 transitions. Word has length 31 [2022-12-14 05:19:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:14,484 INFO L495 AbstractCegarLoop]: Abstraction has 4367 states and 13820 transitions. [2022-12-14 05:19:14,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.453125) internal successors, (93), 64 states have internal predecessors, (93), 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-12-14 05:19:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4367 states and 13820 transitions. [2022-12-14 05:19:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 05:19:14,486 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:14,486 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:14,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2022-12-14 05:19:14,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-12-14 05:19:14,687 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:19:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash 254471223, now seen corresponding path program 8 times [2022-12-14 05:19:14,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:14,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598944404] [2022-12-14 05:19:14,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:14,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:14,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:14,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598944404] [2022-12-14 05:19:14,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598944404] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:19:14,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626613577] [2022-12-14 05:19:14,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:19:14,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:14,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:19:15,000 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:19:15,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-12-14 05:19:16,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-12-14 05:19:16,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:19:16,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 05:19:16,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:19:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 64 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:16,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:19:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 64 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:16,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626613577] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:19:16,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1042982002] [2022-12-14 05:19:16,567 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-12-14 05:19:16,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:19:16,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2022-12-14 05:19:16,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140593478] [2022-12-14 05:19:16,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:19:16,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-14 05:19:16,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:16,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-14 05:19:16,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=1778, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 05:19:16,569 INFO L87 Difference]: Start difference. First operand 4367 states and 13820 transitions. Second operand has 49 states, 48 states have (on average 1.5) internal successors, (72), 48 states have internal predecessors, (72), 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-12-14 05:19:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:17,136 INFO L93 Difference]: Finished difference Result 4219 states and 13337 transitions. [2022-12-14 05:19:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 05:19:17,137 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.5) internal successors, (72), 48 states have internal predecessors, (72), 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-12-14 05:19:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:17,143 INFO L225 Difference]: With dead ends: 4219 [2022-12-14 05:19:17,143 INFO L226 Difference]: Without dead ends: 3460 [2022-12-14 05:19:17,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=842, Invalid=2580, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 05:19:17,143 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 153 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:17,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 125 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:19:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2022-12-14 05:19:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3460. [2022-12-14 05:19:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3460 states, 3436 states have (on average 3.2744470314318974) internal successors, (11251), 3459 states have internal predecessors, (11251), 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-12-14 05:19:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 11251 transitions. [2022-12-14 05:19:17,201 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 11251 transitions. Word has length 31 [2022-12-14 05:19:17,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:17,201 INFO L495 AbstractCegarLoop]: Abstraction has 3460 states and 11251 transitions. [2022-12-14 05:19:17,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.5) internal successors, (72), 48 states have internal predecessors, (72), 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-12-14 05:19:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 11251 transitions. [2022-12-14 05:19:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 05:19:17,203 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:17,204 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:17,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2022-12-14 05:19:17,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-12-14 05:19:17,405 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:19:17,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:17,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1310695092, now seen corresponding path program 13 times [2022-12-14 05:19:17,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:17,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873550530] [2022-12-14 05:19:17,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:17,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:18,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873550530] [2022-12-14 05:19:18,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873550530] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:19:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787566569] [2022-12-14 05:19:18,150 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:19:18,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:18,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:19:18,151 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:19:18,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-12-14 05:19:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:18,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 05:19:18,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:19:18,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:19:18,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:18,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:19:18,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:18,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:19:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:19,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:19:19,607 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3447 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3447) c_~A~0.base) (+ c_~A~0.offset 32)) 9223372039002259456)) is different from false [2022-12-14 05:19:19,718 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:19:19,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:19:19,725 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:19:19,725 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 71 treesize of output 67 [2022-12-14 05:19:19,728 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 54 treesize of output 46 [2022-12-14 05:19:19,731 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 24 treesize of output 20 [2022-12-14 05:19:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:20,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787566569] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:19:20,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1318384912] [2022-12-14 05:19:20,141 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-12-14 05:19:20,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:19:20,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2022-12-14 05:19:20,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239824934] [2022-12-14 05:19:20,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:19:20,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-14 05:19:20,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:20,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-14 05:19:20,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3828, Unknown=13, NotChecked=124, Total=4160 [2022-12-14 05:19:20,143 INFO L87 Difference]: Start difference. First operand 3460 states and 11251 transitions. Second operand has 65 states, 64 states have (on average 1.5) internal successors, (96), 64 states have internal predecessors, (96), 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-12-14 05:19:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:25,781 INFO L93 Difference]: Finished difference Result 5080 states and 14520 transitions. [2022-12-14 05:19:25,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 05:19:25,782 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.5) internal successors, (96), 64 states have internal predecessors, (96), 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-12-14 05:19:25,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:25,789 INFO L225 Difference]: With dead ends: 5080 [2022-12-14 05:19:25,789 INFO L226 Difference]: Without dead ends: 5080 [2022-12-14 05:19:25,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=565, Invalid=8168, Unknown=13, NotChecked=184, Total=8930 [2022-12-14 05:19:25,789 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 599 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 7413 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 7679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:25,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 601 Invalid, 7679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 7413 Invalid, 0 Unknown, 243 Unchecked, 3.4s Time] [2022-12-14 05:19:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2022-12-14 05:19:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 3736. [2022-12-14 05:19:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3736 states, 3712 states have (on average 3.326239224137931) internal successors, (12347), 3735 states have internal predecessors, (12347), 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-12-14 05:19:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 12347 transitions. [2022-12-14 05:19:25,835 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 12347 transitions. Word has length 32 [2022-12-14 05:19:25,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:25,835 INFO L495 AbstractCegarLoop]: Abstraction has 3736 states and 12347 transitions. [2022-12-14 05:19:25,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.5) internal successors, (96), 64 states have internal predecessors, (96), 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-12-14 05:19:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 12347 transitions. [2022-12-14 05:19:25,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 05:19:25,837 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:25,837 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:25,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-12-14 05:19:26,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,72 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:26,039 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:19:26,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:26,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1310695091, now seen corresponding path program 9 times [2022-12-14 05:19:26,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:26,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143705312] [2022-12-14 05:19:26,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:26,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:26,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:26,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143705312] [2022-12-14 05:19:26,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143705312] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:19:26,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494815315] [2022-12-14 05:19:26,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:19:26,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:26,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:19:26,724 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:19:26,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-12-14 05:19:26,953 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:19:26,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:19:26,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 05:19:26,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:19:27,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:19:27,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:27,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:19:27,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:27,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:19:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:27,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:19:28,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:19:28,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:19:28,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:19:28,218 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 159 treesize of output 149 [2022-12-14 05:19:28,221 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 134 treesize of output 126 [2022-12-14 05:19:28,223 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 126 treesize of output 110 [2022-12-14 05:19:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:28,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494815315] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:19:28,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1502525018] [2022-12-14 05:19:28,676 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-12-14 05:19:28,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:19:28,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2022-12-14 05:19:28,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990869082] [2022-12-14 05:19:28,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:19:28,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-12-14 05:19:28,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:28,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-12-14 05:19:28,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3946, Unknown=16, NotChecked=0, Total=4160 [2022-12-14 05:19:28,677 INFO L87 Difference]: Start difference. First operand 3736 states and 12347 transitions. Second operand has 65 states, 64 states have (on average 1.5) internal successors, (96), 64 states have internal predecessors, (96), 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-12-14 05:19:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:34,177 INFO L93 Difference]: Finished difference Result 4942 states and 14108 transitions. [2022-12-14 05:19:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-14 05:19:34,177 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.5) internal successors, (96), 64 states have internal predecessors, (96), 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-12-14 05:19:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:34,183 INFO L225 Difference]: With dead ends: 4942 [2022-12-14 05:19:34,183 INFO L226 Difference]: Without dead ends: 4942 [2022-12-14 05:19:34,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=588, Invalid=8326, Unknown=16, NotChecked=0, Total=8930 [2022-12-14 05:19:34,184 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 648 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 8355 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 8375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 8355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:34,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 681 Invalid, 8375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 8355 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-12-14 05:19:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4942 states. [2022-12-14 05:19:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4942 to 3736. [2022-12-14 05:19:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3736 states, 3712 states have (on average 3.2890625) internal successors, (12209), 3735 states have internal predecessors, (12209), 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-12-14 05:19:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 12209 transitions. [2022-12-14 05:19:34,230 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 12209 transitions. Word has length 32 [2022-12-14 05:19:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:34,230 INFO L495 AbstractCegarLoop]: Abstraction has 3736 states and 12209 transitions. [2022-12-14 05:19:34,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.5) internal successors, (96), 64 states have internal predecessors, (96), 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-12-14 05:19:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 12209 transitions. [2022-12-14 05:19:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 05:19:34,232 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:34,232 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1] [2022-12-14 05:19:34,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-12-14 05:19:34,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,73 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:34,433 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:19:34,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:34,434 INFO L85 PathProgramCache]: Analyzing trace with hash 274323356, now seen corresponding path program 13 times [2022-12-14 05:19:34,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:34,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961775962] [2022-12-14 05:19:34,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:34,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:35,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:35,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961775962] [2022-12-14 05:19:35,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961775962] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:19:35,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777766183] [2022-12-14 05:19:35,195 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:19:35,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:35,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:19:35,196 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:19:35,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-12-14 05:19:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:35,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 05:19:35,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:19:35,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:19:35,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:35,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:19:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:36,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:19:36,592 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3578 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3578) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 05:19:36,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:19:36,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-14 05:19:36,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:19:36,604 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 37 treesize of output 33 [2022-12-14 05:19:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-12-14 05:19:36,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777766183] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:19:36,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [349349340] [2022-12-14 05:19:36,993 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-12-14 05:19:36,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:19:36,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2022-12-14 05:19:36,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535611485] [2022-12-14 05:19:36,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:19:36,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-14 05:19:36,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:36,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-14 05:19:36,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=4225, Unknown=1, NotChecked=130, Total=4556 [2022-12-14 05:19:36,995 INFO L87 Difference]: Start difference. First operand 3736 states and 12209 transitions. Second operand has 68 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 67 states have internal predecessors, (99), 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-12-14 05:19:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:40,072 INFO L93 Difference]: Finished difference Result 5762 states and 17756 transitions. [2022-12-14 05:19:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-14 05:19:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 67 states have internal predecessors, (99), 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 33 [2022-12-14 05:19:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:40,081 INFO L225 Difference]: With dead ends: 5762 [2022-12-14 05:19:40,081 INFO L226 Difference]: Without dead ends: 5762 [2022-12-14 05:19:40,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=548, Invalid=9555, Unknown=1, NotChecked=198, Total=10302 [2022-12-14 05:19:40,082 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 230 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 3920 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 4040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:40,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 120 Invalid, 4040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3920 Invalid, 0 Unknown, 109 Unchecked, 1.4s Time] [2022-12-14 05:19:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2022-12-14 05:19:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 3740. [2022-12-14 05:19:40,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 3716 states have (on average 3.2884822389666306) internal successors, (12220), 3739 states have internal predecessors, (12220), 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-12-14 05:19:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 12220 transitions. [2022-12-14 05:19:40,140 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 12220 transitions. Word has length 33 [2022-12-14 05:19:40,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:40,140 INFO L495 AbstractCegarLoop]: Abstraction has 3740 states and 12220 transitions. [2022-12-14 05:19:40,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 67 states have internal predecessors, (99), 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-12-14 05:19:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 12220 transitions. [2022-12-14 05:19:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 05:19:40,142 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:40,142 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1] [2022-12-14 05:19:40,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2022-12-14 05:19:40,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2022-12-14 05:19:40,343 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:19:40,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:40,344 INFO L85 PathProgramCache]: Analyzing trace with hash 800364453, now seen corresponding path program 1 times [2022-12-14 05:19:40,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:40,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948858059] [2022-12-14 05:19:40,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:40,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-14 05:19:40,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:40,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948858059] [2022-12-14 05:19:40,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948858059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:19:40,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462461489] [2022-12-14 05:19:40,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:40,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:40,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:19:40,537 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:19:40,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-12-14 05:19:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:40,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 05:19:40,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:19:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:41,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:19:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:41,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462461489] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:19:41,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [416177386] [2022-12-14 05:19:41,418 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-12-14 05:19:41,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:19:41,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 22] total 53 [2022-12-14 05:19:41,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878079328] [2022-12-14 05:19:41,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:19:41,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-12-14 05:19:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:41,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-12-14 05:19:41,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=558, Invalid=2198, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 05:19:41,419 INFO L87 Difference]: Start difference. First operand 3740 states and 12220 transitions. Second operand has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 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-12-14 05:19:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:42,849 INFO L93 Difference]: Finished difference Result 6045 states and 16609 transitions. [2022-12-14 05:19:42,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-14 05:19:42,849 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 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 33 [2022-12-14 05:19:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:42,857 INFO L225 Difference]: With dead ends: 6045 [2022-12-14 05:19:42,857 INFO L226 Difference]: Without dead ends: 6005 [2022-12-14 05:19:42,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1606, Invalid=5200, Unknown=0, NotChecked=0, Total=6806 [2022-12-14 05:19:42,857 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 1576 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 2357 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1576 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:42,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1576 Valid, 194 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2357 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 05:19:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2022-12-14 05:19:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3858. [2022-12-14 05:19:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3858 states, 3834 states have (on average 3.238393322900365) internal successors, (12416), 3857 states have internal predecessors, (12416), 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-12-14 05:19:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 12416 transitions. [2022-12-14 05:19:42,920 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 12416 transitions. Word has length 33 [2022-12-14 05:19:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:42,920 INFO L495 AbstractCegarLoop]: Abstraction has 3858 states and 12416 transitions. [2022-12-14 05:19:42,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 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-12-14 05:19:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 12416 transitions. [2022-12-14 05:19:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 05:19:42,923 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:42,923 INFO L195 NwaCegarLoop]: trace histogram [11, 9, 9, 1, 1, 1, 1, 1] [2022-12-14 05:19:42,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-12-14 05:19:43,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,75 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:43,124 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:19:43,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash -611950799, now seen corresponding path program 13 times [2022-12-14 05:19:43,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:43,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052683390] [2022-12-14 05:19:43,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:44,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:44,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052683390] [2022-12-14 05:19:44,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052683390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:19:44,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024969565] [2022-12-14 05:19:44,005 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:19:44,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:44,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:19:44,006 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:19:44,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-12-14 05:19:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:44,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 05:19:44,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:19:44,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 05:19:44,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 05:19:44,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:44,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:19:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:45,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:19:45,388 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3707 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3707) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-12-14 05:19:45,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:19:45,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-12-14 05:19:45,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:19:45,501 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 43 treesize of output 39 [2022-12-14 05:19:45,516 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 9 treesize of output 5 [2022-12-14 05:19:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-12-14 05:19:45,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024969565] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:19:45,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [51862661] [2022-12-14 05:19:45,892 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-12-14 05:19:45,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:19:45,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2022-12-14 05:19:45,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784684171] [2022-12-14 05:19:45,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:19:45,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-12-14 05:19:45,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:45,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-12-14 05:19:45,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=4326, Unknown=13, NotChecked=132, Total=4692 [2022-12-14 05:19:45,894 INFO L87 Difference]: Start difference. First operand 3858 states and 12416 transitions. Second operand has 69 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 68 states have internal predecessors, (99), 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-12-14 05:19:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:19:50,754 INFO L93 Difference]: Finished difference Result 5808 states and 17747 transitions. [2022-12-14 05:19:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-12-14 05:19:50,754 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 68 states have internal predecessors, (99), 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-12-14 05:19:50,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:19:50,763 INFO L225 Difference]: With dead ends: 5808 [2022-12-14 05:19:50,763 INFO L226 Difference]: Without dead ends: 5808 [2022-12-14 05:19:50,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 135 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4513 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1303, Invalid=17048, Unknown=13, NotChecked=268, Total=18632 [2022-12-14 05:19:50,764 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 606 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4222 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 4352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:19:50,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 162 Invalid, 4352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4222 Invalid, 0 Unknown, 108 Unchecked, 1.8s Time] [2022-12-14 05:19:50,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5808 states. [2022-12-14 05:19:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5808 to 3858. [2022-12-14 05:19:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3858 states, 3834 states have (on average 3.238132498695879) internal successors, (12415), 3857 states have internal predecessors, (12415), 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-12-14 05:19:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 12415 transitions. [2022-12-14 05:19:50,818 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 12415 transitions. Word has length 34 [2022-12-14 05:19:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:19:50,818 INFO L495 AbstractCegarLoop]: Abstraction has 3858 states and 12415 transitions. [2022-12-14 05:19:50,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 68 states have internal predecessors, (99), 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-12-14 05:19:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 12415 transitions. [2022-12-14 05:19:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 05:19:50,820 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:19:50,820 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1] [2022-12-14 05:19:50,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2022-12-14 05:19:51,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,76 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:51,022 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:19:51,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:19:51,022 INFO L85 PathProgramCache]: Analyzing trace with hash -85906882, now seen corresponding path program 9 times [2022-12-14 05:19:51,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:19:51,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266555550] [2022-12-14 05:19:51,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:19:51,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:19:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:19:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:51,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:19:51,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266555550] [2022-12-14 05:19:51,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266555550] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:19:51,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904648845] [2022-12-14 05:19:51,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:19:51,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:19:51,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:19:51,996 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:19:51,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-12-14 05:19:52,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:19:52,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:19:52,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 05:19:52,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:19:52,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:19:52,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:52,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:19:53,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:19:53,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:19:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:19:53,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:19:53,455 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3777 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3777) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967296)) is different from false [2022-12-14 05:19:53,459 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3777 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3777) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 4294967296)) is different from false [2022-12-14 05:19:53,466 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3777 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3777) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 4294967296)) is different from false [2022-12-14 05:19:53,711 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3777 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3777) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 28)) 4294967296)) is different from false [2022-12-14 05:19:53,716 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3777 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3777) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 32)) 4294967296)) is different from false [2022-12-14 05:19:53,721 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3777 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3777) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 36)) 4294967296)) is different from false [2022-12-14 05:19:53,780 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3776 (Array Int Int)) (v_ArrVal_3777 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3776) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3777) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 05:19:53,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:19:53,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:19:53,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:19:53,791 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 141 treesize of output 131 [2022-12-14 05:19:53,794 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 118 treesize of output 110 [2022-12-14 05:19:53,798 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 110 treesize of output 94 [2022-12-14 05:19:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 75 not checked. [2022-12-14 05:19:54,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904648845] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:19:54,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [328587353] [2022-12-14 05:19:54,204 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-12-14 05:19:54,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:19:54,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2022-12-14 05:19:54,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297591493] [2022-12-14 05:19:54,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:19:54,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-12-14 05:19:54,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:19:54,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-12-14 05:19:54,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3777, Unknown=52, NotChecked=910, Total=4970 [2022-12-14 05:19:54,206 INFO L87 Difference]: Start difference. First operand 3858 states and 12415 transitions. Second operand has 71 states, 70 states have (on average 1.457142857142857) internal successors, (102), 70 states have internal predecessors, (102), 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-12-14 05:20:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:20:00,296 INFO L93 Difference]: Finished difference Result 5492 states and 15390 transitions. [2022-12-14 05:20:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 05:20:00,296 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 1.457142857142857) internal successors, (102), 70 states have internal predecessors, (102), 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-12-14 05:20:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:20:00,304 INFO L225 Difference]: With dead ends: 5492 [2022-12-14 05:20:00,304 INFO L226 Difference]: Without dead ends: 5492 [2022-12-14 05:20:00,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=495, Invalid=6962, Unknown=53, NotChecked=1232, Total=8742 [2022-12-14 05:20:00,310 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 574 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 9490 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 10974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 9490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1437 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:20:00,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 745 Invalid, 10974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 9490 Invalid, 0 Unknown, 1437 Unchecked, 4.6s Time] [2022-12-14 05:20:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5492 states. [2022-12-14 05:20:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5492 to 3858. [2022-12-14 05:20:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3858 states, 3834 states have (on average 3.1828377673448096) internal successors, (12203), 3857 states have internal predecessors, (12203), 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-12-14 05:20:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 12203 transitions. [2022-12-14 05:20:00,361 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 12203 transitions. Word has length 34 [2022-12-14 05:20:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:20:00,361 INFO L495 AbstractCegarLoop]: Abstraction has 3858 states and 12203 transitions. [2022-12-14 05:20:00,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 1.457142857142857) internal successors, (102), 70 states have internal predecessors, (102), 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-12-14 05:20:00,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 12203 transitions. [2022-12-14 05:20:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 05:20:00,363 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:20:00,363 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:20:00,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2022-12-14 05:20:00,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,77 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:00,564 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:20:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:20:00,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1152537812, now seen corresponding path program 14 times [2022-12-14 05:20:00,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:20:00,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454346111] [2022-12-14 05:20:00,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:20:00,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:20:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 64 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:00,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:20:00,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454346111] [2022-12-14 05:20:00,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454346111] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:20:00,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999768566] [2022-12-14 05:20:00,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:20:00,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:00,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:20:00,926 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:20:00,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-12-14 05:20:01,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-12-14 05:20:01,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:20:01,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 05:20:01,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:20:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 81 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:01,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:20:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 81 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:02,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999768566] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:20:02,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [153539637] [2022-12-14 05:20:02,250 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-12-14 05:20:02,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:20:02,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 52 [2022-12-14 05:20:02,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933573606] [2022-12-14 05:20:02,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:20:02,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-14 05:20:02,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:20:02,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-14 05:20:02,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=692, Invalid=2170, Unknown=0, NotChecked=0, Total=2862 [2022-12-14 05:20:02,251 INFO L87 Difference]: Start difference. First operand 3858 states and 12203 transitions. Second operand has 54 states, 53 states have (on average 1.490566037735849) internal successors, (79), 53 states have internal predecessors, (79), 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-12-14 05:20:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:20:02,753 INFO L93 Difference]: Finished difference Result 3740 states and 11711 transitions. [2022-12-14 05:20:02,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 05:20:02,754 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.490566037735849) internal successors, (79), 53 states have internal predecessors, (79), 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-12-14 05:20:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:20:02,758 INFO L225 Difference]: With dead ends: 3740 [2022-12-14 05:20:02,758 INFO L226 Difference]: Without dead ends: 2817 [2022-12-14 05:20:02,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 10 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2043 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1014, Invalid=3146, Unknown=0, NotChecked=0, Total=4160 [2022-12-14 05:20:02,759 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 166 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:20:02,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 101 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:20:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2022-12-14 05:20:02,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2817. [2022-12-14 05:20:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2817 states, 2793 states have (on average 3.277121374865736) internal successors, (9153), 2816 states have internal predecessors, (9153), 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-12-14 05:20:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 9153 transitions. [2022-12-14 05:20:02,790 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 9153 transitions. Word has length 34 [2022-12-14 05:20:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:20:02,790 INFO L495 AbstractCegarLoop]: Abstraction has 2817 states and 9153 transitions. [2022-12-14 05:20:02,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.490566037735849) internal successors, (79), 53 states have internal predecessors, (79), 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-12-14 05:20:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 9153 transitions. [2022-12-14 05:20:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 05:20:02,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:20:02,792 INFO L195 NwaCegarLoop]: trace histogram [11, 9, 9, 1, 1, 1, 1, 1, 1] [2022-12-14 05:20:02,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2022-12-14 05:20:02,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,78 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:02,993 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:20:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:20:02,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1790601881, now seen corresponding path program 9 times [2022-12-14 05:20:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:20:02,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391872898] [2022-12-14 05:20:02,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:20:02,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:20:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:03,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:20:03,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391872898] [2022-12-14 05:20:03,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391872898] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:20:03,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481211925] [2022-12-14 05:20:03,859 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:20:03,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:03,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:20:03,860 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:20:03,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-12-14 05:20:04,160 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:20:04,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:20:04,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-14 05:20:04,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:20:04,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:20:04,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:04,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-14 05:20:04,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:04,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:20:05,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:05,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:20:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:05,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:20:05,287 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3915 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3915) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-12-14 05:20:05,478 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3915 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3915) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 20)) 9223372039002259456))) is different from false [2022-12-14 05:20:05,483 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3915 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3915) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 24)) 9223372039002259456))) is different from false [2022-12-14 05:20:05,630 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3915 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3915) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 36)) 9223372039002259456))) is different from false [2022-12-14 05:20:05,635 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3915 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3915) c_~A~0.base) (+ c_~A~0.offset 36)) 9223372039002259456))) is different from false [2022-12-14 05:20:05,828 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 05:20:05,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-12-14 05:20:05,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:20:05,837 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 159 treesize of output 149 [2022-12-14 05:20:05,842 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 134 treesize of output 118 [2022-12-14 05:20:05,848 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 63 treesize of output 55 [2022-12-14 05:20:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 56 not checked. [2022-12-14 05:20:06,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481211925] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:20:06,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [467840442] [2022-12-14 05:20:06,257 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-12-14 05:20:06,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:20:06,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2022-12-14 05:20:06,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051522371] [2022-12-14 05:20:06,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:20:06,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-12-14 05:20:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:20:06,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-12-14 05:20:06,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=4391, Unknown=82, NotChecked=690, Total=5402 [2022-12-14 05:20:06,259 INFO L87 Difference]: Start difference. First operand 2817 states and 9153 transitions. Second operand has 74 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 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-12-14 05:20:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:20:13,282 INFO L93 Difference]: Finished difference Result 3837 states and 10870 transitions. [2022-12-14 05:20:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 05:20:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 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 35 [2022-12-14 05:20:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:20:13,287 INFO L225 Difference]: With dead ends: 3837 [2022-12-14 05:20:13,287 INFO L226 Difference]: Without dead ends: 3837 [2022-12-14 05:20:13,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1721 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=577, Invalid=7551, Unknown=82, NotChecked=910, Total=9120 [2022-12-14 05:20:13,288 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 634 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 8861 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 10354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 8861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1436 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:20:13,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 678 Invalid, 10354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 8861 Invalid, 0 Unknown, 1436 Unchecked, 5.4s Time] [2022-12-14 05:20:13,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2022-12-14 05:20:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 2817. [2022-12-14 05:20:13,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2817 states, 2793 states have (on average 3.2581453634085213) internal successors, (9100), 2816 states have internal predecessors, (9100), 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-12-14 05:20:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 9100 transitions. [2022-12-14 05:20:13,322 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 9100 transitions. Word has length 35 [2022-12-14 05:20:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:20:13,322 INFO L495 AbstractCegarLoop]: Abstraction has 2817 states and 9100 transitions. [2022-12-14 05:20:13,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 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-12-14 05:20:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 9100 transitions. [2022-12-14 05:20:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 05:20:13,324 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:20:13,324 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2022-12-14 05:20:13,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2022-12-14 05:20:13,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 79 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2022-12-14 05:20:13,525 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:20:13,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:20:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1631767232, now seen corresponding path program 14 times [2022-12-14 05:20:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:20:13,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050849519] [2022-12-14 05:20:13,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:20:13,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:20:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:13,947 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 81 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:13,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:20:13,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050849519] [2022-12-14 05:20:13,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050849519] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:20:13,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821476013] [2022-12-14 05:20:13,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:20:13,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:13,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:20:13,948 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:20:13,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-12-14 05:20:14,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-14 05:20:14,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:20:14,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 05:20:14,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:20:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 100 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:14,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:20:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 100 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:15,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821476013] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:20:15,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1688814894] [2022-12-14 05:20:15,323 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-12-14 05:20:15,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:20:15,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 57 [2022-12-14 05:20:15,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66369736] [2022-12-14 05:20:15,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:20:15,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-14 05:20:15,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:20:15,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-14 05:20:15,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=821, Invalid=2601, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 05:20:15,324 INFO L87 Difference]: Start difference. First operand 2817 states and 9100 transitions. Second operand has 59 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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-12-14 05:20:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:20:16,787 INFO L93 Difference]: Finished difference Result 3885 states and 10679 transitions. [2022-12-14 05:20:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 05:20:16,788 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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 35 [2022-12-14 05:20:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:20:16,793 INFO L225 Difference]: With dead ends: 3885 [2022-12-14 05:20:16,793 INFO L226 Difference]: Without dead ends: 3841 [2022-12-14 05:20:16,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 23 SyntacticMatches, 11 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2683 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1629, Invalid=4851, Unknown=0, NotChecked=0, Total=6480 [2022-12-14 05:20:16,793 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 389 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 2154 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:20:16,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 180 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2154 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 05:20:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2022-12-14 05:20:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 2719. [2022-12-14 05:20:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2695 states have (on average 3.053061224489796) internal successors, (8228), 2718 states have internal predecessors, (8228), 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-12-14 05:20:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 8228 transitions. [2022-12-14 05:20:16,828 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 8228 transitions. Word has length 35 [2022-12-14 05:20:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:20:16,828 INFO L495 AbstractCegarLoop]: Abstraction has 2719 states and 8228 transitions. [2022-12-14 05:20:16,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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-12-14 05:20:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 8228 transitions. [2022-12-14 05:20:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 05:20:16,830 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:20:16,830 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:20:16,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2022-12-14 05:20:17,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,80 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:17,032 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:20:17,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:20:17,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1437734486, now seen corresponding path program 15 times [2022-12-14 05:20:17,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:20:17,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185377427] [2022-12-14 05:20:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:20:17,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:20:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:17,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:20:17,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185377427] [2022-12-14 05:20:17,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185377427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:20:17,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496124181] [2022-12-14 05:20:17,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:20:17,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:17,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:20:17,902 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:20:17,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-12-14 05:20:18,190 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:20:18,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:20:18,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-14 05:20:18,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:20:18,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:20:18,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:18,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:20:18,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:18,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:20:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:19,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:20:19,639 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4047 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4047) c_~A~0.base) (+ c_~A~0.offset 36)) 9223372039002259456)) is different from false [2022-12-14 05:20:19,645 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4046 (Array Int Int)) (v_ArrVal_4047 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4046) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4047) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) is different from false [2022-12-14 05:20:19,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:20:19,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:20:19,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:20:19,657 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 71 treesize of output 67 [2022-12-14 05:20:19,660 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 54 treesize of output 46 [2022-12-14 05:20:19,663 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 24 treesize of output 20 [2022-12-14 05:20:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-12-14 05:20:20,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496124181] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:20:20,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1268611945] [2022-12-14 05:20:20,134 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-12-14 05:20:20,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:20:20,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2022-12-14 05:20:20,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053589273] [2022-12-14 05:20:20,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:20:20,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-12-14 05:20:20,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:20:20,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-12-14 05:20:20,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=4487, Unknown=2, NotChecked=270, Total=4970 [2022-12-14 05:20:20,135 INFO L87 Difference]: Start difference. First operand 2719 states and 8228 transitions. Second operand has 71 states, 70 states have (on average 1.5) internal successors, (105), 70 states have internal predecessors, (105), 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-12-14 05:20:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:20:27,353 INFO L93 Difference]: Finished difference Result 3565 states and 9974 transitions. [2022-12-14 05:20:27,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 05:20:27,354 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 1.5) internal successors, (105), 70 states have internal predecessors, (105), 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 35 [2022-12-14 05:20:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:20:27,359 INFO L225 Difference]: With dead ends: 3565 [2022-12-14 05:20:27,359 INFO L226 Difference]: Without dead ends: 3565 [2022-12-14 05:20:27,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1221 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=596, Invalid=9712, Unknown=2, NotChecked=402, Total=10712 [2022-12-14 05:20:27,359 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 671 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 10960 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 11325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 10960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:20:27,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 899 Invalid, 11325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 10960 Invalid, 0 Unknown, 343 Unchecked, 4.8s Time] [2022-12-14 05:20:27,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3565 states. [2022-12-14 05:20:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3565 to 2923. [2022-12-14 05:20:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2899 states have (on average 3.0948602966540184) internal successors, (8972), 2922 states have internal predecessors, (8972), 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-12-14 05:20:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 8972 transitions. [2022-12-14 05:20:27,395 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 8972 transitions. Word has length 35 [2022-12-14 05:20:27,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:20:27,395 INFO L495 AbstractCegarLoop]: Abstraction has 2923 states and 8972 transitions. [2022-12-14 05:20:27,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 1.5) internal successors, (105), 70 states have internal predecessors, (105), 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-12-14 05:20:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 8972 transitions. [2022-12-14 05:20:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 05:20:27,397 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:20:27,397 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:20:27,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2022-12-14 05:20:27,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2022-12-14 05:20:27,598 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:20:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:20:27,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1437734487, now seen corresponding path program 10 times [2022-12-14 05:20:27,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:20:27,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324215438] [2022-12-14 05:20:27,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:20:27,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:20:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:28,334 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:20:28,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324215438] [2022-12-14 05:20:28,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324215438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:20:28,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133131872] [2022-12-14 05:20:28,335 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:20:28,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:28,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:20:28,336 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:20:28,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-12-14 05:20:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:28,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 05:20:28,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:20:28,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:20:29,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:29,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:20:29,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:29,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:20:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:29,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:20:30,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:20:30,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:20:30,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:20:30,174 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 159 treesize of output 149 [2022-12-14 05:20:30,178 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 134 treesize of output 118 [2022-12-14 05:20:30,181 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 118 treesize of output 110 [2022-12-14 05:20:30,751 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:30,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133131872] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:20:30,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1249707856] [2022-12-14 05:20:30,752 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-12-14 05:20:30,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:20:30,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2022-12-14 05:20:30,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33280377] [2022-12-14 05:20:30,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:20:30,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-12-14 05:20:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:20:30,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-12-14 05:20:30,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=4445, Unknown=23, NotChecked=0, Total=4692 [2022-12-14 05:20:30,753 INFO L87 Difference]: Start difference. First operand 2923 states and 8972 transitions. Second operand has 69 states, 68 states have (on average 1.5) internal successors, (102), 68 states have internal predecessors, (102), 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-12-14 05:20:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:20:36,170 INFO L93 Difference]: Finished difference Result 3463 states and 9680 transitions. [2022-12-14 05:20:36,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 05:20:36,170 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 1.5) internal successors, (102), 68 states have internal predecessors, (102), 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 35 [2022-12-14 05:20:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:20:36,175 INFO L225 Difference]: With dead ends: 3463 [2022-12-14 05:20:36,175 INFO L226 Difference]: Without dead ends: 3463 [2022-12-14 05:20:36,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=553, Invalid=7614, Unknown=23, NotChecked=0, Total=8190 [2022-12-14 05:20:36,176 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 503 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 9567 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 9583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 9567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:20:36,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 778 Invalid, 9583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 9567 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-12-14 05:20:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2022-12-14 05:20:36,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 2923. [2022-12-14 05:20:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2923 states, 2899 states have (on average 3.0596757502587097) internal successors, (8870), 2922 states have internal predecessors, (8870), 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-12-14 05:20:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 8870 transitions. [2022-12-14 05:20:36,210 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 8870 transitions. Word has length 35 [2022-12-14 05:20:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:20:36,210 INFO L495 AbstractCegarLoop]: Abstraction has 2923 states and 8870 transitions. [2022-12-14 05:20:36,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 1.5) internal successors, (102), 68 states have internal predecessors, (102), 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-12-14 05:20:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 8870 transitions. [2022-12-14 05:20:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 05:20:36,212 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:20:36,212 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1] [2022-12-14 05:20:36,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2022-12-14 05:20:36,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-12-14 05:20:36,412 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:20:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:20:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash 325829845, now seen corresponding path program 14 times [2022-12-14 05:20:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:20:36,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849287009] [2022-12-14 05:20:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:20:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:20:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:20:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:37,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:20:37,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849287009] [2022-12-14 05:20:37,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849287009] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:20:37,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49754932] [2022-12-14 05:20:37,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:20:37,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:20:37,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:20:37,228 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:20:37,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-12-14 05:20:37,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-14 05:20:37,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:20:37,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 05:20:37,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:20:38,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:20:38,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:20:38,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:20:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 100 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:39,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:20:40,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:20:40,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-14 05:20:40,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:20:40,413 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 47 treesize of output 43 [2022-12-14 05:20:40,417 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 15 treesize of output 9 [2022-12-14 05:20:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 90 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:20:41,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49754932] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:20:41,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1757034149] [2022-12-14 05:20:41,460 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-12-14 05:20:41,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:20:41,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2022-12-14 05:20:41,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422941201] [2022-12-14 05:20:41,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:20:41,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-12-14 05:20:41,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:20:41,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-12-14 05:20:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=4868, Unknown=0, NotChecked=0, Total=5402 [2022-12-14 05:20:41,461 INFO L87 Difference]: Start difference. First operand 2923 states and 8870 transitions. Second operand has 74 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 73 states have internal predecessors, (108), 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-12-14 05:20:42,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:20:45,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:20:49,254 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 [0] [2022-12-14 05:20:52,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:21:00,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:21:06,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:21:09,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:21:11,261 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 [0, 1] [2022-12-14 05:21:15,990 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 [0, 1] [2022-12-14 05:21:20,444 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 [0] [2022-12-14 05:21:22,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:21:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:21:28,072 INFO L93 Difference]: Finished difference Result 10207 states and 27069 transitions. [2022-12-14 05:21:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2022-12-14 05:21:28,073 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 73 states have internal predecessors, (108), 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 36 [2022-12-14 05:21:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:21:28,087 INFO L225 Difference]: With dead ends: 10207 [2022-12-14 05:21:28,087 INFO L226 Difference]: Without dead ends: 10207 [2022-12-14 05:21:28,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18764 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=6242, Invalid=56508, Unknown=0, NotChecked=0, Total=62750 [2022-12-14 05:21:28,090 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1005 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 8464 mSolverCounterSat, 82 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 8554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 8464 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:21:28,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 303 Invalid, 8554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 8464 Invalid, 8 Unknown, 0 Unchecked, 26.6s Time] [2022-12-14 05:21:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10207 states. [2022-12-14 05:21:28,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10207 to 4171. [2022-12-14 05:21:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 4147 states have (on average 3.204967446346757) internal successors, (13291), 4170 states have internal predecessors, (13291), 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-12-14 05:21:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 13291 transitions. [2022-12-14 05:21:28,162 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 13291 transitions. Word has length 36 [2022-12-14 05:21:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:21:28,162 INFO L495 AbstractCegarLoop]: Abstraction has 4171 states and 13291 transitions. [2022-12-14 05:21:28,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 1.4794520547945205) internal successors, (108), 73 states have internal predecessors, (108), 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-12-14 05:21:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 13291 transitions. [2022-12-14 05:21:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 05:21:28,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:21:28,164 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1] [2022-12-14 05:21:28,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2022-12-14 05:21:28,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,83 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:21:28,366 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:21:28,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:21:28,366 INFO L85 PathProgramCache]: Analyzing trace with hash 325829846, now seen corresponding path program 15 times [2022-12-14 05:21:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:21:28,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123453352] [2022-12-14 05:21:28,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:21:28,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:21:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:21:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:21:29,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:21:29,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123453352] [2022-12-14 05:21:29,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123453352] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:21:29,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590736609] [2022-12-14 05:21:29,163 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:21:29,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:21:29,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:21:29,164 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:21:29,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-12-14 05:21:29,543 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:21:29,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:21:29,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 05:21:29,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:21:29,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:21:29,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:21:29,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:21:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:21:30,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:21:30,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:21:30,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-14 05:21:30,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:21:30,868 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 37 treesize of output 33 [2022-12-14 05:21:30,877 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 7 treesize of output 3 [2022-12-14 05:21:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:21:31,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590736609] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:21:31,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1054617224] [2022-12-14 05:21:31,310 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-12-14 05:21:31,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:21:31,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2022-12-14 05:21:31,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654881780] [2022-12-14 05:21:31,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:21:31,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-12-14 05:21:31,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:21:31,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-12-14 05:21:31,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=4871, Unknown=10, NotChecked=0, Total=5112 [2022-12-14 05:21:31,312 INFO L87 Difference]: Start difference. First operand 4171 states and 13291 transitions. Second operand has 72 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 71 states have internal predecessors, (105), 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-12-14 05:21:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:21:34,274 INFO L93 Difference]: Finished difference Result 6215 states and 18819 transitions. [2022-12-14 05:21:34,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 05:21:34,275 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 71 states have internal predecessors, (105), 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 36 [2022-12-14 05:21:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:21:34,283 INFO L225 Difference]: With dead ends: 6215 [2022-12-14 05:21:34,283 INFO L226 Difference]: Without dead ends: 6215 [2022-12-14 05:21:34,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=525, Invalid=8777, Unknown=10, NotChecked=0, Total=9312 [2022-12-14 05:21:34,284 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 197 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4759 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 4770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:21:34,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 135 Invalid, 4770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4759 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-14 05:21:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6215 states. [2022-12-14 05:21:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6215 to 4176. [2022-12-14 05:21:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 4152 states have (on average 3.203757225433526) internal successors, (13302), 4175 states have internal predecessors, (13302), 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-12-14 05:21:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 13302 transitions. [2022-12-14 05:21:34,340 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 13302 transitions. Word has length 36 [2022-12-14 05:21:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:21:34,340 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 13302 transitions. [2022-12-14 05:21:34,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 71 states have internal predecessors, (105), 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-12-14 05:21:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 13302 transitions. [2022-12-14 05:21:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 05:21:34,342 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:21:34,342 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1] [2022-12-14 05:21:34,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2022-12-14 05:21:34,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,84 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:21:34,544 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:21:34,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:21:34,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1510794307, now seen corresponding path program 10 times [2022-12-14 05:21:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:21:34,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801366924] [2022-12-14 05:21:34,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:21:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:21:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:21:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:21:35,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:21:35,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801366924] [2022-12-14 05:21:35,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801366924] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:21:35,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068499399] [2022-12-14 05:21:35,623 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:21:35,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:21:35,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:21:35,624 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:21:35,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-12-14 05:21:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:21:35,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-14 05:21:35,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:21:36,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:21:36,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:21:36,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:21:37,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:21:37,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:21:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:21:37,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:21:37,460 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4329 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4329) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-12-14 05:21:37,553 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4329 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4329) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 16)) 9223372039002259456))) is different from false [2022-12-14 05:21:37,559 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4329 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4329) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 20)) 9223372039002259456))) is different from false [2022-12-14 05:21:37,742 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4329 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4329) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 32)) 9223372039002259456))) is different from false [2022-12-14 05:21:37,749 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4329 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4329) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 36)) 9223372039002259456))) is different from false [2022-12-14 05:21:37,945 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4328 (Array Int Int)) (v_ArrVal_4329 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4328) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4329) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-12-14 05:21:37,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:21:37,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:21:37,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:21:37,961 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 81 treesize of output 77 [2022-12-14 05:21:37,965 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 32 treesize of output 28 [2022-12-14 05:21:37,968 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 58 treesize of output 50 [2022-12-14 05:21:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 86 not checked. [2022-12-14 05:21:38,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068499399] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:21:38,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [878952873] [2022-12-14 05:21:38,490 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-12-14 05:21:38,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:21:38,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2022-12-14 05:21:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407253158] [2022-12-14 05:21:38,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:21:38,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-12-14 05:21:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:21:38,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-12-14 05:21:38,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4662, Unknown=78, NotChecked=858, Total=5852 [2022-12-14 05:21:38,492 INFO L87 Difference]: Start difference. First operand 4176 states and 13302 transitions. Second operand has 77 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 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-12-14 05:21:46,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:21:46,825 INFO L93 Difference]: Finished difference Result 6331 states and 17941 transitions. [2022-12-14 05:21:46,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 05:21:46,825 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 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 37 [2022-12-14 05:21:46,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:21:46,834 INFO L225 Difference]: With dead ends: 6331 [2022-12-14 05:21:46,834 INFO L226 Difference]: Without dead ends: 6331 [2022-12-14 05:21:46,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=556, Invalid=8510, Unknown=78, NotChecked=1158, Total=10302 [2022-12-14 05:21:46,835 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 691 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 13383 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 15273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 13383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1826 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:21:46,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1043 Invalid, 15273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 13383 Invalid, 0 Unknown, 1826 Unchecked, 6.2s Time] [2022-12-14 05:21:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6331 states. [2022-12-14 05:21:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6331 to 4404. [2022-12-14 05:21:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4404 states, 4380 states have (on average 3.2360730593607308) internal successors, (14174), 4403 states have internal predecessors, (14174), 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-12-14 05:21:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 14174 transitions. [2022-12-14 05:21:46,891 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 14174 transitions. Word has length 37 [2022-12-14 05:21:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:21:46,897 INFO L495 AbstractCegarLoop]: Abstraction has 4404 states and 14174 transitions. [2022-12-14 05:21:46,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 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-12-14 05:21:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 14174 transitions. [2022-12-14 05:21:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 05:21:46,900 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:21:46,900 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1] [2022-12-14 05:21:46,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-12-14 05:21:47,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable92 [2022-12-14 05:21:47,101 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:21:47,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:21:47,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1510794308, now seen corresponding path program 10 times [2022-12-14 05:21:47,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:21:47,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62357185] [2022-12-14 05:21:47,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:21:47,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:21:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:21:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:21:48,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:21:48,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62357185] [2022-12-14 05:21:48,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62357185] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:21:48,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181449839] [2022-12-14 05:21:48,091 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:21:48,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:21:48,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:21:48,092 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:21:48,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-12-14 05:21:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:21:48,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 05:21:48,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:21:48,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:21:48,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:21:48,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:21:49,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:21:49,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:21:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:21:49,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:21:50,071 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4403 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4403) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 16)) 4294967296)) is different from false [2022-12-14 05:21:50,078 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4403 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4403) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 20)) 4294967296)) is different from false [2022-12-14 05:21:50,379 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4403 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4403) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 36)) 4294967296)) is different from false [2022-12-14 05:21:50,481 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4403 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4403) c_~A~0.base) (+ c_~A~0.offset 40)) 4294967296)) is different from false [2022-12-14 05:21:50,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:21:50,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-12-14 05:21:50,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:21:50,634 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 141 treesize of output 131 [2022-12-14 05:21:50,639 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 59 treesize of output 51 [2022-12-14 05:21:50,642 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 110 treesize of output 94 [2022-12-14 05:21:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 51 not checked. [2022-12-14 05:21:51,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181449839] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:21:51,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1191076434] [2022-12-14 05:21:51,423 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-12-14 05:21:51,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:21:51,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2022-12-14 05:21:51,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498098222] [2022-12-14 05:21:51,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:21:51,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-12-14 05:21:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:21:51,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-12-14 05:21:51,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=4952, Unknown=110, NotChecked=580, Total=5852 [2022-12-14 05:21:51,425 INFO L87 Difference]: Start difference. First operand 4404 states and 14174 transitions. Second operand has 77 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 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-12-14 05:22:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:22:03,330 INFO L93 Difference]: Finished difference Result 6274 states and 17722 transitions. [2022-12-14 05:22:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 05:22:03,330 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 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 37 [2022-12-14 05:22:03,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:22:03,338 INFO L225 Difference]: With dead ends: 6274 [2022-12-14 05:22:03,339 INFO L226 Difference]: Without dead ends: 6274 [2022-12-14 05:22:03,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 112 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=601, Invalid=11292, Unknown=113, NotChecked=876, Total=12882 [2022-12-14 05:22:03,339 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 789 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 13527 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 14298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 13527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 709 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:22:03,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 1063 Invalid, 14298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 13527 Invalid, 0 Unknown, 709 Unchecked, 7.9s Time] [2022-12-14 05:22:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6274 states. [2022-12-14 05:22:03,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6274 to 4404. [2022-12-14 05:22:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4404 states, 4380 states have (on average 3.2100456621004567) internal successors, (14060), 4403 states have internal predecessors, (14060), 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-12-14 05:22:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 14060 transitions. [2022-12-14 05:22:03,400 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 14060 transitions. Word has length 37 [2022-12-14 05:22:03,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:22:03,400 INFO L495 AbstractCegarLoop]: Abstraction has 4404 states and 14060 transitions. [2022-12-14 05:22:03,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 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-12-14 05:22:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 14060 transitions. [2022-12-14 05:22:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 05:22:03,402 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:22:03,402 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:22:03,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-12-14 05:22:03,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,86 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:03,603 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:22:03,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:22:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1316600394, now seen corresponding path program 16 times [2022-12-14 05:22:03,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:22:03,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14426948] [2022-12-14 05:22:03,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:03,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:22:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 81 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:04,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:22:04,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14426948] [2022-12-14 05:22:04,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14426948] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:22:04,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713130630] [2022-12-14 05:22:04,037 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:22:04,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:04,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:22:04,038 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:22:04,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-12-14 05:22:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:04,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-14 05:22:04,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:22:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 100 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:04,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:22:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 100 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:05,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713130630] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:22:05,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2067704513] [2022-12-14 05:22:05,021 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-12-14 05:22:05,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:22:05,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 57 [2022-12-14 05:22:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246499275] [2022-12-14 05:22:05,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:22:05,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-14 05:22:05,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:22:05,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-14 05:22:05,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=821, Invalid=2601, Unknown=0, NotChecked=0, Total=3422 [2022-12-14 05:22:05,023 INFO L87 Difference]: Start difference. First operand 4404 states and 14060 transitions. Second operand has 59 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:05,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:22:05,592 INFO L93 Difference]: Finished difference Result 4274 states and 13518 transitions. [2022-12-14 05:22:05,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 05:22:05,593 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-12-14 05:22:05,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:22:05,598 INFO L225 Difference]: With dead ends: 4274 [2022-12-14 05:22:05,598 INFO L226 Difference]: Without dead ends: 3171 [2022-12-14 05:22:05,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 27 SyntacticMatches, 11 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2474 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1202, Invalid=3768, Unknown=0, NotChecked=0, Total=4970 [2022-12-14 05:22:05,599 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 205 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:22:05,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 115 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:22:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2022-12-14 05:22:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3171. [2022-12-14 05:22:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 3147 states have (on average 3.317445185891325) internal successors, (10440), 3170 states have internal predecessors, (10440), 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-12-14 05:22:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 10440 transitions. [2022-12-14 05:22:05,638 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 10440 transitions. Word has length 37 [2022-12-14 05:22:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:22:05,638 INFO L495 AbstractCegarLoop]: Abstraction has 3171 states and 10440 transitions. [2022-12-14 05:22:05,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:22:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 10440 transitions. [2022-12-14 05:22:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 05:22:05,640 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:22:05,640 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1] [2022-12-14 05:22:05,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2022-12-14 05:22:05,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,87 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:05,841 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:22:05,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:22:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash -410103430, now seen corresponding path program 16 times [2022-12-14 05:22:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:22:05,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150843282] [2022-12-14 05:22:05,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:22:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 100 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:06,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:22:06,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150843282] [2022-12-14 05:22:06,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150843282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:22:06,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068091826] [2022-12-14 05:22:06,398 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:22:06,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:06,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:22:06,399 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:22:06,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-12-14 05:22:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:06,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 05:22:06,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:22:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 121 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:07,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:22:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 121 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:07,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068091826] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:22:07,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [276467618] [2022-12-14 05:22:07,695 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-12-14 05:22:07,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:22:07,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 62 [2022-12-14 05:22:07,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512231302] [2022-12-14 05:22:07,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:22:07,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-14 05:22:07,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:22:07,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-14 05:22:07,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=961, Invalid=3071, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 05:22:07,697 INFO L87 Difference]: Start difference. First operand 3171 states and 10440 transitions. Second operand has 64 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 63 states have internal predecessors, (91), 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-12-14 05:22:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:22:09,551 INFO L93 Difference]: Finished difference Result 5801 states and 16657 transitions. [2022-12-14 05:22:09,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 05:22:09,551 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 63 states have internal predecessors, (91), 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 38 [2022-12-14 05:22:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:22:09,568 INFO L225 Difference]: With dead ends: 5801 [2022-12-14 05:22:09,569 INFO L226 Difference]: Without dead ends: 5709 [2022-12-14 05:22:09,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 25 SyntacticMatches, 12 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3198 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1914, Invalid=5742, Unknown=0, NotChecked=0, Total=7656 [2022-12-14 05:22:09,569 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 358 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 2777 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:22:09,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 234 Invalid, 2783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2777 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 05:22:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5709 states. [2022-12-14 05:22:09,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5709 to 3179. [2022-12-14 05:22:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3179 states, 3155 states have (on average 3.0608557844690965) internal successors, (9657), 3178 states have internal predecessors, (9657), 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-12-14 05:22:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 9657 transitions. [2022-12-14 05:22:09,638 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 9657 transitions. Word has length 38 [2022-12-14 05:22:09,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:22:09,638 INFO L495 AbstractCegarLoop]: Abstraction has 3179 states and 9657 transitions. [2022-12-14 05:22:09,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 63 states have internal predecessors, (91), 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-12-14 05:22:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 9657 transitions. [2022-12-14 05:22:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 05:22:09,640 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:22:09,640 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:22:09,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2022-12-14 05:22:09,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,88 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:09,840 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:22:09,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:22:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2102989388, now seen corresponding path program 17 times [2022-12-14 05:22:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:22:09,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258105879] [2022-12-14 05:22:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:22:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:10,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:22:10,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258105879] [2022-12-14 05:22:10,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258105879] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:22:10,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791688434] [2022-12-14 05:22:10,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:22:10,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:10,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:22:10,743 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:22:10,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-12-14 05:22:12,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-14 05:22:12,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:22:12,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 05:22:12,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:22:12,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:22:12,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:12,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:22:12,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:12,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:22:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 100 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:13,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:22:14,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:22:14,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:22:14,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:22:14,809 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 79 treesize of output 75 [2022-12-14 05:22:14,813 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 60 treesize of output 48 [2022-12-14 05:22:14,818 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 26 treesize of output 20 [2022-12-14 05:22:16,182 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 90 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:16,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791688434] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:22:16,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [719440661] [2022-12-14 05:22:16,182 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-12-14 05:22:16,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:22:16,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2022-12-14 05:22:16,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414138604] [2022-12-14 05:22:16,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:22:16,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-12-14 05:22:16,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:22:16,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-12-14 05:22:16,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=5304, Unknown=4, NotChecked=0, Total=5852 [2022-12-14 05:22:16,185 INFO L87 Difference]: Start difference. First operand 3179 states and 9657 transitions. Second operand has 77 states, 76 states have (on average 1.5) internal successors, (114), 76 states have internal predecessors, (114), 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-12-14 05:22:17,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:22:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:22:53,891 INFO L93 Difference]: Finished difference Result 6655 states and 18602 transitions. [2022-12-14 05:22:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-12-14 05:22:53,892 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 1.5) internal successors, (114), 76 states have internal predecessors, (114), 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 38 [2022-12-14 05:22:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:22:53,902 INFO L225 Difference]: With dead ends: 6655 [2022-12-14 05:22:53,902 INFO L226 Difference]: Without dead ends: 6655 [2022-12-14 05:22:53,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7970 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=2689, Invalid=29169, Unknown=4, NotChecked=0, Total=31862 [2022-12-14 05:22:53,904 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 2798 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 13873 mSolverCounterSat, 181 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2798 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 14055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 13873 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:22:53,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2798 Valid, 1299 Invalid, 14055 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [181 Valid, 13873 Invalid, 1 Unknown, 0 Unchecked, 16.3s Time] [2022-12-14 05:22:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6655 states. [2022-12-14 05:22:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6655 to 4699. [2022-12-14 05:22:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4699 states, 4675 states have (on average 3.162994652406417) internal successors, (14787), 4698 states have internal predecessors, (14787), 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-12-14 05:22:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 14787 transitions. [2022-12-14 05:22:53,986 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 14787 transitions. Word has length 38 [2022-12-14 05:22:53,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:22:53,986 INFO L495 AbstractCegarLoop]: Abstraction has 4699 states and 14787 transitions. [2022-12-14 05:22:53,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 1.5) internal successors, (114), 76 states have internal predecessors, (114), 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-12-14 05:22:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 14787 transitions. [2022-12-14 05:22:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 05:22:53,991 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:22:53,991 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:22:53,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2022-12-14 05:22:54,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,89 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:54,192 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:22:54,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:22:54,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2102989389, now seen corresponding path program 11 times [2022-12-14 05:22:54,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:22:54,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109951826] [2022-12-14 05:22:54,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:22:54,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:22:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:22:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:55,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:22:55,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109951826] [2022-12-14 05:22:55,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109951826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:22:55,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606425253] [2022-12-14 05:22:55,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:22:55,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:22:55,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:22:55,055 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:22:55,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-12-14 05:22:55,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-12-14 05:22:55,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:22:55,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-14 05:22:55,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:22:56,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:22:56,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:56,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:22:56,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:22:56,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:22:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:22:56,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:22:57,256 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4683 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4683) c_~A~0.base) (+ c_~A~0.offset 40)) 4294967296))) is different from false [2022-12-14 05:22:57,262 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4682 (Array Int Int)) (v_ArrVal_4683 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4682) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_4683) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-12-14 05:22:57,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:22:57,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:22:57,274 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:22:57,275 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 81 treesize of output 77 [2022-12-14 05:22:57,278 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 32 treesize of output 28 [2022-12-14 05:22:57,281 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 58 treesize of output 50 [2022-12-14 05:22:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-12-14 05:22:57,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606425253] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:22:57,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [623545577] [2022-12-14 05:22:57,746 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-12-14 05:22:57,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:22:57,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 73 [2022-12-14 05:22:57,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434767597] [2022-12-14 05:22:57,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:22:57,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-12-14 05:22:57,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:22:57,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-14 05:22:57,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=5022, Unknown=2, NotChecked=286, Total=5550 [2022-12-14 05:22:57,747 INFO L87 Difference]: Start difference. First operand 4699 states and 14787 transitions. Second operand has 75 states, 74 states have (on average 1.5) internal successors, (111), 74 states have internal predecessors, (111), 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-12-14 05:23:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:23:04,008 INFO L93 Difference]: Finished difference Result 5627 states and 16566 transitions. [2022-12-14 05:23:04,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-14 05:23:04,009 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.5) internal successors, (111), 74 states have internal predecessors, (111), 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 38 [2022-12-14 05:23:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:23:04,018 INFO L225 Difference]: With dead ends: 5627 [2022-12-14 05:23:04,018 INFO L226 Difference]: Without dead ends: 5627 [2022-12-14 05:23:04,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=552, Invalid=8766, Unknown=2, NotChecked=382, Total=9702 [2022-12-14 05:23:04,019 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 536 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 11543 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 11969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 11543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 405 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:23:04,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 946 Invalid, 11969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 11543 Invalid, 0 Unknown, 405 Unchecked, 4.8s Time] [2022-12-14 05:23:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5627 states. [2022-12-14 05:23:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5627 to 4989. [2022-12-14 05:23:04,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4989 states, 4965 states have (on average 3.1438066465256798) internal successors, (15609), 4988 states have internal predecessors, (15609), 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-12-14 05:23:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 15609 transitions. [2022-12-14 05:23:04,082 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 15609 transitions. Word has length 38 [2022-12-14 05:23:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:23:04,082 INFO L495 AbstractCegarLoop]: Abstraction has 4989 states and 15609 transitions. [2022-12-14 05:23:04,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.5) internal successors, (111), 74 states have internal predecessors, (111), 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-12-14 05:23:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 15609 transitions. [2022-12-14 05:23:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 05:23:04,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:23:04,085 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1] [2022-12-14 05:23:04,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2022-12-14 05:23:04,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2022-12-14 05:23:04,286 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:23:04,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:23:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1777002588, now seen corresponding path program 17 times [2022-12-14 05:23:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:23:04,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084594673] [2022-12-14 05:23:04,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:23:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:23:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:23:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:23:05,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:23:05,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084594673] [2022-12-14 05:23:05,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084594673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:23:05,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713580016] [2022-12-14 05:23:05,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:23:05,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:23:05,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:23:05,143 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:23:05,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-12-14 05:23:06,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-12-14 05:23:06,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:23:06,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-14 05:23:06,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:23:06,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:23:06,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:23:06,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:23:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:23:07,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:23:07,861 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4756 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_4756) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 05:23:07,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:23:07,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-14 05:23:07,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:23:07,873 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 37 treesize of output 33 [2022-12-14 05:23:07,882 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 7 treesize of output 3 [2022-12-14 05:23:08,450 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-12-14 05:23:08,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713580016] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:23:08,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [282708629] [2022-12-14 05:23:08,450 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-12-14 05:23:08,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:23:08,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 76 [2022-12-14 05:23:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826301881] [2022-12-14 05:23:08,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:23:08,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-12-14 05:23:08,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:23:08,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-12-14 05:23:08,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=5606, Unknown=1, NotChecked=150, Total=6006 [2022-12-14 05:23:08,451 INFO L87 Difference]: Start difference. First operand 4989 states and 15609 transitions. Second operand has 78 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 77 states have internal predecessors, (114), 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-12-14 05:23:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:23:11,621 INFO L93 Difference]: Finished difference Result 7260 states and 21905 transitions. [2022-12-14 05:23:11,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-14 05:23:11,621 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 77 states have internal predecessors, (114), 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 39 [2022-12-14 05:23:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:23:11,633 INFO L225 Difference]: With dead ends: 7260 [2022-12-14 05:23:11,634 INFO L226 Difference]: Without dead ends: 7260 [2022-12-14 05:23:11,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=542, Invalid=10173, Unknown=1, NotChecked=204, Total=10920 [2022-12-14 05:23:11,634 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 153 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 6067 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 6204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 6067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:23:11,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 209 Invalid, 6204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 6067 Invalid, 0 Unknown, 128 Unchecked, 2.2s Time] [2022-12-14 05:23:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7260 states. [2022-12-14 05:23:11,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7260 to 4993. [2022-12-14 05:23:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4993 states, 4969 states have (on average 3.143489635741598) internal successors, (15620), 4992 states have internal predecessors, (15620), 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-12-14 05:23:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4993 states to 4993 states and 15620 transitions. [2022-12-14 05:23:11,736 INFO L78 Accepts]: Start accepts. Automaton has 4993 states and 15620 transitions. Word has length 39 [2022-12-14 05:23:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:23:11,737 INFO L495 AbstractCegarLoop]: Abstraction has 4993 states and 15620 transitions. [2022-12-14 05:23:11,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 77 states have internal predecessors, (114), 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-12-14 05:23:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4993 states and 15620 transitions. [2022-12-14 05:23:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 05:23:11,741 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:23:11,741 INFO L195 NwaCegarLoop]: trace histogram [13, 11, 11, 1, 1, 1, 1, 1] [2022-12-14 05:23:11,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-12-14 05:23:11,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,91 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:23:11,941 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:23:11,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:23:11,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1201203527, now seen corresponding path program 15 times [2022-12-14 05:23:11,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:23:11,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701049725] [2022-12-14 05:23:11,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:23:11,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:23:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:23:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:23:12,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:23:12,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701049725] [2022-12-14 05:23:12,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701049725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:23:12,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226067188] [2022-12-14 05:23:12,919 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:23:12,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:23:12,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:23:12,920 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:23:12,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-12-14 05:23:13,225 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:23:13,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:23:13,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-14 05:23:13,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:23:13,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:23:13,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:23:13,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-14 05:23:13,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:23:13,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:23:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:23:14,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:23:15,152 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 05:23:15,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2022-12-14 05:23:15,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:23:15,158 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 43 treesize of output 39 [2022-12-14 05:23:15,168 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 9 treesize of output 5 [2022-12-14 05:23:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:23:15,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226067188] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:23:15,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1446531016] [2022-12-14 05:23:15,764 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-12-14 05:23:15,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:23:15,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 79 [2022-12-14 05:23:15,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006805364] [2022-12-14 05:23:15,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:23:15,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-12-14 05:23:15,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:23:15,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-12-14 05:23:15,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=6184, Unknown=30, NotChecked=0, Total=6480 [2022-12-14 05:23:15,766 INFO L87 Difference]: Start difference. First operand 4993 states and 15620 transitions. Second operand has 81 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 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-12-14 05:23:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:23:19,666 INFO L93 Difference]: Finished difference Result 7310 states and 22009 transitions. [2022-12-14 05:23:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-14 05:23:19,667 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 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 40 [2022-12-14 05:23:19,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:23:19,678 INFO L225 Difference]: With dead ends: 7310 [2022-12-14 05:23:19,678 INFO L226 Difference]: Without dead ends: 7310 [2022-12-14 05:23:19,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2453 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=663, Invalid=10863, Unknown=30, NotChecked=0, Total=11556 [2022-12-14 05:23:19,679 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 226 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4962 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 4971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 4962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:23:19,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 135 Invalid, 4971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 4962 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-12-14 05:23:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7310 states. [2022-12-14 05:23:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7310 to 4993. [2022-12-14 05:23:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4993 states, 4969 states have (on average 3.143288388005635) internal successors, (15619), 4992 states have internal predecessors, (15619), 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-12-14 05:23:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4993 states to 4993 states and 15619 transitions. [2022-12-14 05:23:19,749 INFO L78 Accepts]: Start accepts. Automaton has 4993 states and 15619 transitions. Word has length 40 [2022-12-14 05:23:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:23:19,749 INFO L495 AbstractCegarLoop]: Abstraction has 4993 states and 15619 transitions. [2022-12-14 05:23:19,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 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-12-14 05:23:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4993 states and 15619 transitions. [2022-12-14 05:23:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 05:23:19,752 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:23:19,752 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1] [2022-12-14 05:23:19,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2022-12-14 05:23:19,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2022-12-14 05:23:19,953 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:23:19,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:23:19,953 INFO L85 PathProgramCache]: Analyzing trace with hash 747498293, now seen corresponding path program 11 times [2022-12-14 05:23:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:23:19,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417802880] [2022-12-14 05:23:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:23:19,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:23:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:23:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:23:21,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:23:21,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417802880] [2022-12-14 05:23:21,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417802880] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:23:21,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682753621] [2022-12-14 05:23:21,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:23:21,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:23:21,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:23:21,071 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:23:21,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-12-14 05:23:21,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-12-14 05:23:21,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:23:21,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-14 05:23:21,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:23:22,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:23:22,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:23:22,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:23:23,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:23:23,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 05:23:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 110 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:23:23,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:23:25,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:23:25,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-12-14 05:23:25,318 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:23:25,318 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 89 treesize of output 85 [2022-12-14 05:23:25,322 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 68 treesize of output 56 [2022-12-14 05:23:25,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 30 treesize of output 24 [2022-12-14 05:23:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 110 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:23:26,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682753621] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:23:26,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1915523074] [2022-12-14 05:23:26,737 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-12-14 05:23:26,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:23:26,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2022-12-14 05:23:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713139122] [2022-12-14 05:23:26,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:23:26,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-12-14 05:23:26,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:23:26,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-12-14 05:23:26,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=6156, Unknown=10, NotChecked=0, Total=6806 [2022-12-14 05:23:26,739 INFO L87 Difference]: Start difference. First operand 4993 states and 15619 transitions. Second operand has 83 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 82 states have internal predecessors, (120), 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-12-14 05:23:28,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:24:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:24:30,564 INFO L93 Difference]: Finished difference Result 12823 states and 32684 transitions. [2022-12-14 05:24:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2022-12-14 05:24:30,564 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 82 states have internal predecessors, (120), 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 40 [2022-12-14 05:24:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:24:30,582 INFO L225 Difference]: With dead ends: 12823 [2022-12-14 05:24:30,582 INFO L226 Difference]: Without dead ends: 12823 [2022-12-14 05:24:30,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15190 ImplicationChecksByTransitivity, 40.4s TimeCoverageRelationStatistics Valid=4998, Invalid=51398, Unknown=10, NotChecked=0, Total=56406 [2022-12-14 05:24:30,584 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 3946 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 25771 mSolverCounterSat, 452 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3946 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 26224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 25771 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:24:30,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3946 Valid, 2506 Invalid, 26224 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [452 Valid, 25771 Invalid, 1 Unknown, 0 Unchecked, 27.1s Time] [2022-12-14 05:24:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12823 states. [2022-12-14 05:24:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12823 to 6705. [2022-12-14 05:24:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6705 states, 6681 states have (on average 3.1879958090106273) internal successors, (21299), 6704 states have internal predecessors, (21299), 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-12-14 05:24:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6705 states to 6705 states and 21299 transitions. [2022-12-14 05:24:30,693 INFO L78 Accepts]: Start accepts. Automaton has 6705 states and 21299 transitions. Word has length 40 [2022-12-14 05:24:30,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:24:30,693 INFO L495 AbstractCegarLoop]: Abstraction has 6705 states and 21299 transitions. [2022-12-14 05:24:30,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 82 states have internal predecessors, (120), 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-12-14 05:24:30,693 INFO L276 IsEmpty]: Start isEmpty. Operand 6705 states and 21299 transitions. [2022-12-14 05:24:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 05:24:30,697 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:24:30,697 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1] [2022-12-14 05:24:30,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2022-12-14 05:24:30,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 93 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2022-12-14 05:24:30,898 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:24:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:24:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash 747498294, now seen corresponding path program 11 times [2022-12-14 05:24:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:24:30,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435351980] [2022-12-14 05:24:30,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:24:30,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:24:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:24:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:24:31,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:24:31,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435351980] [2022-12-14 05:24:31,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435351980] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:24:31,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519068804] [2022-12-14 05:24:31,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:24:31,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:24:31,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:24:31,953 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:24:31,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-12-14 05:24:32,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-12-14 05:24:32,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:24:32,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-14 05:24:33,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:24:33,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-14 05:24:33,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:33,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:24:34,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:24:34,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:24:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 110 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:24:34,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:24:36,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:24:36,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:24:36,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:24:36,061 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 157 treesize of output 145 [2022-12-14 05:24:36,067 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 65 treesize of output 53 [2022-12-14 05:24:36,072 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 118 treesize of output 94 [2022-12-14 05:24:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 110 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:24:37,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519068804] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:24:37,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [566518667] [2022-12-14 05:24:37,486 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-12-14 05:24:37,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:24:37,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2022-12-14 05:24:37,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418993692] [2022-12-14 05:24:37,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:24:37,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-12-14 05:24:37,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:24:37,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-12-14 05:24:37,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=6154, Unknown=11, NotChecked=0, Total=6806 [2022-12-14 05:24:37,488 INFO L87 Difference]: Start difference. First operand 6705 states and 21299 transitions. Second operand has 83 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 82 states have internal predecessors, (120), 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-12-14 05:24:39,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 05:25:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:25:33,306 INFO L93 Difference]: Finished difference Result 12701 states and 32156 transitions. [2022-12-14 05:25:33,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2022-12-14 05:25:33,306 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 82 states have internal predecessors, (120), 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 40 [2022-12-14 05:25:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:25:33,322 INFO L225 Difference]: With dead ends: 12701 [2022-12-14 05:25:33,322 INFO L226 Difference]: Without dead ends: 12701 [2022-12-14 05:25:33,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15278 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=4999, Invalid=51396, Unknown=11, NotChecked=0, Total=56406 [2022-12-14 05:25:33,324 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 4296 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 26028 mSolverCounterSat, 519 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4296 SdHoareTripleChecker+Valid, 2499 SdHoareTripleChecker+Invalid, 26548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 26028 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:25:33,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4296 Valid, 2499 Invalid, 26548 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [519 Valid, 26028 Invalid, 1 Unknown, 0 Unchecked, 28.1s Time] [2022-12-14 05:25:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12701 states. [2022-12-14 05:25:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12701 to 6653. [2022-12-14 05:25:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6653 states, 6629 states have (on average 3.1692562980841754) internal successors, (21009), 6652 states have internal predecessors, (21009), 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-12-14 05:25:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6653 states to 6653 states and 21009 transitions. [2022-12-14 05:25:33,426 INFO L78 Accepts]: Start accepts. Automaton has 6653 states and 21009 transitions. Word has length 40 [2022-12-14 05:25:33,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:25:33,426 INFO L495 AbstractCegarLoop]: Abstraction has 6653 states and 21009 transitions. [2022-12-14 05:25:33,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 82 states have internal predecessors, (120), 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-12-14 05:25:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 6653 states and 21009 transitions. [2022-12-14 05:25:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 05:25:33,429 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:25:33,430 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:25:33,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2022-12-14 05:25:33,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,94 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:25:33,631 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:25:33,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:25:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1956766675, now seen corresponding path program 12 times [2022-12-14 05:25:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:25:33,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548898720] [2022-12-14 05:25:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:25:33,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:25:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:25:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 100 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:25:34,056 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:25:34,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548898720] [2022-12-14 05:25:34,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548898720] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:25:34,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082364270] [2022-12-14 05:25:34,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:25:34,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:25:34,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:25:34,057 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:25:34,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-12-14 05:25:34,450 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:25:34,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:25:34,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 05:25:34,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:25:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 121 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:25:34,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:25:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 121 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:25:35,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082364270] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:25:35,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1635726291] [2022-12-14 05:25:35,435 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-12-14 05:25:35,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:25:35,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 62 [2022-12-14 05:25:35,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910378475] [2022-12-14 05:25:35,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:25:35,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-14 05:25:35,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:25:35,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-14 05:25:35,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=961, Invalid=3071, Unknown=0, NotChecked=0, Total=4032 [2022-12-14 05:25:35,437 INFO L87 Difference]: Start difference. First operand 6653 states and 21009 transitions. Second operand has 64 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 states have internal predecessors, (93), 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-12-14 05:25:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:25:36,215 INFO L93 Difference]: Finished difference Result 6505 states and 20516 transitions. [2022-12-14 05:25:36,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 05:25:36,216 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 states have internal predecessors, (93), 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 40 [2022-12-14 05:25:36,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:25:36,223 INFO L225 Difference]: With dead ends: 6505 [2022-12-14 05:25:36,223 INFO L226 Difference]: Without dead ends: 5206 [2022-12-14 05:25:36,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 29 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2946 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1406, Invalid=4446, Unknown=0, NotChecked=0, Total=5852 [2022-12-14 05:25:36,224 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 197 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:25:36,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 132 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 05:25:36,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5206 states. [2022-12-14 05:25:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5206 to 5206. [2022-12-14 05:25:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5206 states, 5182 states have (on average 3.255499807024315) internal successors, (16870), 5205 states have internal predecessors, (16870), 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-12-14 05:25:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 16870 transitions. [2022-12-14 05:25:36,283 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 16870 transitions. Word has length 40 [2022-12-14 05:25:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:25:36,284 INFO L495 AbstractCegarLoop]: Abstraction has 5206 states and 16870 transitions. [2022-12-14 05:25:36,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 63 states have internal predecessors, (93), 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-12-14 05:25:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 16870 transitions. [2022-12-14 05:25:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 05:25:36,286 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:25:36,286 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1, 1, 1] [2022-12-14 05:25:36,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-12-14 05:25:36,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-12-14 05:25:36,488 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:25:36,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:25:36,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1697524069, now seen corresponding path program 1 times [2022-12-14 05:25:36,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:25:36,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433920765] [2022-12-14 05:25:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:25:36,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:25:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:25:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-14 05:25:36,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:25:36,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433920765] [2022-12-14 05:25:36,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433920765] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:25:36,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69107449] [2022-12-14 05:25:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:25:36,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:25:36,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:25:36,700 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:25:36,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-12-14 05:25:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:25:37,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 05:25:37,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:25:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-14 05:25:37,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:25:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-12-14 05:25:37,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69107449] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:25:37,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1247087953] [2022-12-14 05:25:37,316 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-12-14 05:25:37,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:25:37,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2022-12-14 05:25:37,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133574217] [2022-12-14 05:25:37,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:25:37,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 05:25:37,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:25:37,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 05:25:37,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-12-14 05:25:37,318 INFO L87 Difference]: Start difference. First operand 5206 states and 16870 transitions. Second operand has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 27 states have internal predecessors, (59), 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-12-14 05:25:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:25:37,798 INFO L93 Difference]: Finished difference Result 16691 states and 47824 transitions. [2022-12-14 05:25:37,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 05:25:37,798 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 27 states have internal predecessors, (59), 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 41 [2022-12-14 05:25:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:25:37,827 INFO L225 Difference]: With dead ends: 16691 [2022-12-14 05:25:37,827 INFO L226 Difference]: Without dead ends: 16691 [2022-12-14 05:25:37,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2022-12-14 05:25:37,828 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 998 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:25:37,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 31 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:25:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16691 states. [2022-12-14 05:25:37,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16691 to 9923. [2022-12-14 05:25:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9923 states, 9899 states have (on average 3.599555510657642) internal successors, (35632), 9922 states have internal predecessors, (35632), 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-12-14 05:25:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9923 states to 9923 states and 35632 transitions. [2022-12-14 05:25:38,034 INFO L78 Accepts]: Start accepts. Automaton has 9923 states and 35632 transitions. Word has length 41 [2022-12-14 05:25:38,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:25:38,034 INFO L495 AbstractCegarLoop]: Abstraction has 9923 states and 35632 transitions. [2022-12-14 05:25:38,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 27 states have internal predecessors, (59), 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-12-14 05:25:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 9923 states and 35632 transitions. [2022-12-14 05:25:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 05:25:38,037 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:25:38,037 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:25:38,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2022-12-14 05:25:38,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-12-14 05:25:38,238 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:25:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:25:38,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1286864937, now seen corresponding path program 13 times [2022-12-14 05:25:38,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:25:38,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41312320] [2022-12-14 05:25:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:25:38,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:25:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:25:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:25:39,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:25:39,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41312320] [2022-12-14 05:25:39,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41312320] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:25:39,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530817033] [2022-12-14 05:25:39,240 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:25:39,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:25:39,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:25:39,241 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:25:39,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-12-14 05:25:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:25:39,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-14 05:25:39,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:25:40,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:25:40,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:40,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:25:40,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:40,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:25:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:25:40,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:25:41,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:25:41,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-14 05:25:41,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:25:41,525 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 159 treesize of output 149 [2022-12-14 05:25:41,531 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 67 treesize of output 59 [2022-12-14 05:25:41,534 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 126 treesize of output 110 [2022-12-14 05:25:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:25:42,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530817033] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:25:42,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2139375866] [2022-12-14 05:25:42,224 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-12-14 05:25:42,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:25:42,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2022-12-14 05:25:42,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128315220] [2022-12-14 05:25:42,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:25:42,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-12-14 05:25:42,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:25:42,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-12-14 05:25:42,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=6535, Unknown=20, NotChecked=0, Total=6806 [2022-12-14 05:25:42,226 INFO L87 Difference]: Start difference. First operand 9923 states and 35632 transitions. Second operand has 83 states, 82 states have (on average 1.5) internal successors, (123), 82 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:25:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:25:52,244 INFO L93 Difference]: Finished difference Result 14555 states and 45729 transitions. [2022-12-14 05:25:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 05:25:52,244 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 1.5) internal successors, (123), 82 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-12-14 05:25:52,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:25:52,267 INFO L225 Difference]: With dead ends: 14555 [2022-12-14 05:25:52,267 INFO L226 Difference]: Without dead ends: 14555 [2022-12-14 05:25:52,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=761, Invalid=13980, Unknown=21, NotChecked=0, Total=14762 [2022-12-14 05:25:52,268 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 804 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 15894 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 15919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 15894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-12-14 05:25:52,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1301 Invalid, 15919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 15894 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-12-14 05:25:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14555 states. [2022-12-14 05:25:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14555 to 10571. [2022-12-14 05:25:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10571 states, 10547 states have (on average 3.6294680951929457) internal successors, (38280), 10570 states have internal predecessors, (38280), 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-12-14 05:25:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10571 states to 10571 states and 38280 transitions. [2022-12-14 05:25:52,452 INFO L78 Accepts]: Start accepts. Automaton has 10571 states and 38280 transitions. Word has length 41 [2022-12-14 05:25:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:25:52,452 INFO L495 AbstractCegarLoop]: Abstraction has 10571 states and 38280 transitions. [2022-12-14 05:25:52,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 1.5) internal successors, (123), 82 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:25:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 10571 states and 38280 transitions. [2022-12-14 05:25:52,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 05:25:52,455 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:25:52,455 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 11, 1, 1, 1, 1, 1, 1] [2022-12-14 05:25:52,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2022-12-14 05:25:52,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,97 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:25:52,656 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:25:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:25:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash 989641427, now seen corresponding path program 1 times [2022-12-14 05:25:52,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:25:52,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107434067] [2022-12-14 05:25:52,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:25:52,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:25:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:25:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2022-12-14 05:25:52,777 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:25:52,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107434067] [2022-12-14 05:25:52,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107434067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:25:52,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:25:52,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:25:52,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27414580] [2022-12-14 05:25:52,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:25:52,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:25:52,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:25:52,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:25:52,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:25:52,777 INFO L87 Difference]: Start difference. First operand 10571 states and 38280 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:25:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:25:52,858 INFO L93 Difference]: Finished difference Result 10505 states and 36310 transitions. [2022-12-14 05:25:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:25:52,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-12-14 05:25:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:25:52,878 INFO L225 Difference]: With dead ends: 10505 [2022-12-14 05:25:52,878 INFO L226 Difference]: Without dead ends: 10505 [2022-12-14 05:25:52,878 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-12-14 05:25:52,878 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:25:52,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:25:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10505 states. [2022-12-14 05:25:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10505 to 10097. [2022-12-14 05:25:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10097 states, 10078 states have (on average 3.526493351855527) internal successors, (35540), 10096 states have internal predecessors, (35540), 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-12-14 05:25:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10097 states to 10097 states and 35540 transitions. [2022-12-14 05:25:53,033 INFO L78 Accepts]: Start accepts. Automaton has 10097 states and 35540 transitions. Word has length 42 [2022-12-14 05:25:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:25:53,034 INFO L495 AbstractCegarLoop]: Abstraction has 10097 states and 35540 transitions. [2022-12-14 05:25:53,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:25:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 10097 states and 35540 transitions. [2022-12-14 05:25:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 05:25:53,037 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:25:53,037 INFO L195 NwaCegarLoop]: trace histogram [13, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:25:53,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-14 05:25:53,037 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:25:53,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:25:53,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1994747540, now seen corresponding path program 18 times [2022-12-14 05:25:53,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:25:53,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619398823] [2022-12-14 05:25:53,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:25:53,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:25:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:25:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:25:54,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:25:54,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619398823] [2022-12-14 05:25:54,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619398823] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:25:54,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835287998] [2022-12-14 05:25:54,097 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:25:54,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:25:54,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:25:54,097 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:25:54,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-12-14 05:25:54,442 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:25:54,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:25:54,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 74 conjunts are in the unsatisfiable core [2022-12-14 05:25:54,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:25:54,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:25:54,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:54,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 05:25:54,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:54,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:25:55,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:25:55,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:25:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:25:55,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:25:56,595 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 05:25:56,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-12-14 05:25:56,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:25:56,601 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 71 treesize of output 67 [2022-12-14 05:25:56,603 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 54 treesize of output 46 [2022-12-14 05:25:56,606 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 24 treesize of output 20 [2022-12-14 05:25:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:25:57,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835287998] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:25:57,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1572926055] [2022-12-14 05:25:57,239 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-12-14 05:25:57,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:25:57,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 82 [2022-12-14 05:25:57,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050611860] [2022-12-14 05:25:57,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:25:57,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-12-14 05:25:57,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:25:57,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-12-14 05:25:57,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=6654, Unknown=40, NotChecked=0, Total=6972 [2022-12-14 05:25:57,241 INFO L87 Difference]: Start difference. First operand 10097 states and 35540 transitions. Second operand has 84 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 83 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:26:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:26:04,326 INFO L93 Difference]: Finished difference Result 12617 states and 39706 transitions. [2022-12-14 05:26:04,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 05:26:04,327 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 83 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-12-14 05:26:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:26:04,348 INFO L225 Difference]: With dead ends: 12617 [2022-12-14 05:26:04,348 INFO L226 Difference]: Without dead ends: 12617 [2022-12-14 05:26:04,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2566 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=747, Invalid=11203, Unknown=40, NotChecked=0, Total=11990 [2022-12-14 05:26:04,349 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 542 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 12394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 12416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 12394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:26:04,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1106 Invalid, 12416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 12394 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-12-14 05:26:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12617 states. [2022-12-14 05:26:04,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12617 to 10097. [2022-12-14 05:26:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10097 states, 10078 states have (on average 3.5052589799563405) internal successors, (35326), 10096 states have internal predecessors, (35326), 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-12-14 05:26:04,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10097 states to 10097 states and 35326 transitions. [2022-12-14 05:26:04,492 INFO L78 Accepts]: Start accepts. Automaton has 10097 states and 35326 transitions. Word has length 42 [2022-12-14 05:26:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:26:04,492 INFO L495 AbstractCegarLoop]: Abstraction has 10097 states and 35326 transitions. [2022-12-14 05:26:04,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 83 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:26:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 10097 states and 35326 transitions. [2022-12-14 05:26:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 05:26:04,495 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:26:04,495 INFO L195 NwaCegarLoop]: trace histogram [14, 12, 12, 1, 1, 1, 1, 1] [2022-12-14 05:26:04,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2022-12-14 05:26:04,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,98 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:26:04,697 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:26:04,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:26:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash 520117127, now seen corresponding path program 16 times [2022-12-14 05:26:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:26:04,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144849763] [2022-12-14 05:26:04,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:26:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:26:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:26:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:26:05,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:26:05,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144849763] [2022-12-14 05:26:05,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144849763] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:26:05,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504622777] [2022-12-14 05:26:05,832 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 05:26:05,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:26:05,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:26:05,832 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:26:05,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-12-14 05:26:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:26:06,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-14 05:26:06,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:26:06,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 05:26:06,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 05:26:06,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:06,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:26:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:26:06,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:26:07,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:26:07,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2022-12-14 05:26:07,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:26:07,581 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 43 treesize of output 39 [2022-12-14 05:26:07,591 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 9 treesize of output 5 [2022-12-14 05:26:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:26:08,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504622777] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:26:08,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [578423455] [2022-12-14 05:26:08,035 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-12-14 05:26:08,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:26:08,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 73 [2022-12-14 05:26:08,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914719523] [2022-12-14 05:26:08,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:26:08,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-12-14 05:26:08,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:26:08,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-14 05:26:08,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=5286, Unknown=27, NotChecked=0, Total=5550 [2022-12-14 05:26:08,037 INFO L87 Difference]: Start difference. First operand 10097 states and 35326 transitions. Second operand has 75 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 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-12-14 05:26:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:26:14,771 INFO L93 Difference]: Finished difference Result 15643 states and 50689 transitions. [2022-12-14 05:26:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-12-14 05:26:14,772 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 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 43 [2022-12-14 05:26:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:26:14,802 INFO L225 Difference]: With dead ends: 15643 [2022-12-14 05:26:14,802 INFO L226 Difference]: Without dead ends: 15643 [2022-12-14 05:26:14,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6051 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1583, Invalid=23196, Unknown=27, NotChecked=0, Total=24806 [2022-12-14 05:26:14,803 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 475 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 5242 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 5242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:26:14,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 150 Invalid, 5257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 5242 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 05:26:14,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15643 states. [2022-12-14 05:26:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15643 to 10097. [2022-12-14 05:26:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10097 states, 10078 states have (on average 3.5051597539194286) internal successors, (35325), 10096 states have internal predecessors, (35325), 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-12-14 05:26:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10097 states to 10097 states and 35325 transitions. [2022-12-14 05:26:14,977 INFO L78 Accepts]: Start accepts. Automaton has 10097 states and 35325 transitions. Word has length 43 [2022-12-14 05:26:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:26:14,977 INFO L495 AbstractCegarLoop]: Abstraction has 10097 states and 35325 transitions. [2022-12-14 05:26:14,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 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-12-14 05:26:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 10097 states and 35325 transitions. [2022-12-14 05:26:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 05:26:14,980 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:26:14,980 INFO L195 NwaCegarLoop]: trace histogram [14, 12, 12, 1, 1, 1, 1, 1] [2022-12-14 05:26:14,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2022-12-14 05:26:15,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2022-12-14 05:26:15,181 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:26:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:26:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash 520117128, now seen corresponding path program 18 times [2022-12-14 05:26:15,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:26:15,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999912422] [2022-12-14 05:26:15,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:26:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:26:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:26:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:26:16,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:26:16,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999912422] [2022-12-14 05:26:16,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999912422] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:26:16,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356566019] [2022-12-14 05:26:16,492 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:26:16,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:26:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:26:16,493 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:26:16,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-12-14 05:26:16,898 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:26:16,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:26:16,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-14 05:26:16,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:26:17,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:26:17,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:17,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 05:26:17,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:17,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:26:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:26:17,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:26:18,069 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5502 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_5502) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 05:26:18,205 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 05:26:18,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2022-12-14 05:26:18,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:26:18,211 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 37 treesize of output 33 [2022-12-14 05:26:18,222 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 7 treesize of output 3 [2022-12-14 05:26:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-12-14 05:26:18,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356566019] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:26:18,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [600571031] [2022-12-14 05:26:18,805 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-12-14 05:26:18,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:26:18,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 74 [2022-12-14 05:26:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777016019] [2022-12-14 05:26:18,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:26:18,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-12-14 05:26:18,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:26:18,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-12-14 05:26:18,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=5291, Unknown=26, NotChecked=146, Total=5700 [2022-12-14 05:26:18,807 INFO L87 Difference]: Start difference. First operand 10097 states and 35325 transitions. Second operand has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:26:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:26:23,277 INFO L93 Difference]: Finished difference Result 15556 states and 50498 transitions. [2022-12-14 05:26:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-14 05:26:23,278 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-12-14 05:26:23,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:26:23,307 INFO L225 Difference]: With dead ends: 15556 [2022-12-14 05:26:23,307 INFO L226 Difference]: Without dead ends: 15556 [2022-12-14 05:26:23,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2411 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=615, Invalid=10075, Unknown=26, NotChecked=204, Total=10920 [2022-12-14 05:26:23,308 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 151 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 5618 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 05:26:23,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 164 Invalid, 5771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 5618 Invalid, 0 Unknown, 146 Unchecked, 2.8s Time] [2022-12-14 05:26:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15556 states. [2022-12-14 05:26:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15556 to 10097. [2022-12-14 05:26:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10097 states, 10078 states have (on average 3.505060527882516) internal successors, (35324), 10096 states have internal predecessors, (35324), 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-12-14 05:26:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10097 states to 10097 states and 35324 transitions. [2022-12-14 05:26:23,478 INFO L78 Accepts]: Start accepts. Automaton has 10097 states and 35324 transitions. Word has length 43 [2022-12-14 05:26:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:26:23,479 INFO L495 AbstractCegarLoop]: Abstraction has 10097 states and 35324 transitions. [2022-12-14 05:26:23,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:26:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 10097 states and 35324 transitions. [2022-12-14 05:26:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 05:26:23,482 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:26:23,482 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:26:23,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2022-12-14 05:26:23,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,100 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:26:23,683 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:26:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:26:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash 273403703, now seen corresponding path program 14 times [2022-12-14 05:26:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:26:23,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091589586] [2022-12-14 05:26:23,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:26:23,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:26:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:26:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 121 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:26:24,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:26:24,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091589586] [2022-12-14 05:26:24,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091589586] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:26:24,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235310601] [2022-12-14 05:26:24,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:26:24,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:26:24,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:26:24,192 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:26:24,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-12-14 05:26:25,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2022-12-14 05:26:25,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:26:25,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 05:26:25,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:26:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 144 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:26:26,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:26:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 144 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:26:26,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235310601] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:26:26,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1671346143] [2022-12-14 05:26:26,945 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-12-14 05:26:26,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:26:26,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 67 [2022-12-14 05:26:26,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630220098] [2022-12-14 05:26:26,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:26:26,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-12-14 05:26:26,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:26:26,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-12-14 05:26:26,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=3580, Unknown=0, NotChecked=0, Total=4692 [2022-12-14 05:26:26,947 INFO L87 Difference]: Start difference. First operand 10097 states and 35324 transitions. Second operand has 69 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 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-12-14 05:26:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:26:28,427 INFO L93 Difference]: Finished difference Result 11341 states and 36603 transitions. [2022-12-14 05:26:28,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-14 05:26:28,427 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 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 43 [2022-12-14 05:26:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:26:28,446 INFO L225 Difference]: With dead ends: 11341 [2022-12-14 05:26:28,446 INFO L226 Difference]: Without dead ends: 11235 [2022-12-14 05:26:28,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 31 SyntacticMatches, 13 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3758 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2222, Invalid=6708, Unknown=0, NotChecked=0, Total=8930 [2022-12-14 05:26:28,447 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 242 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 2300 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 2313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 05:26:28,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 314 Invalid, 2313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 05:26:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11235 states. [2022-12-14 05:26:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11235 to 9883. [2022-12-14 05:26:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9883 states, 9864 states have (on average 3.350060827250608) internal successors, (33045), 9882 states have internal predecessors, (33045), 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-12-14 05:26:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 33045 transitions. [2022-12-14 05:26:28,589 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 33045 transitions. Word has length 43 [2022-12-14 05:26:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:26:28,589 INFO L495 AbstractCegarLoop]: Abstraction has 9883 states and 33045 transitions. [2022-12-14 05:26:28,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 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-12-14 05:26:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 33045 transitions. [2022-12-14 05:26:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 05:26:28,592 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:26:28,592 INFO L195 NwaCegarLoop]: trace histogram [14, 12, 12, 1, 1, 1, 1, 1, 1] [2022-12-14 05:26:28,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0 [2022-12-14 05:26:28,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,101 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:26:28,793 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2022-12-14 05:26:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:26:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1056234543, now seen corresponding path program 12 times [2022-12-14 05:26:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:26:28,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666651168] [2022-12-14 05:26:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:26:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:26:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:26:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:26:30,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:26:30,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666651168] [2022-12-14 05:26:30,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666651168] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:26:30,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296751766] [2022-12-14 05:26:30,200 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 05:26:30,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:26:30,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:26:30,201 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:26:30,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40e085a5-66ec-40fe-ab72-93b3ab3363d2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-12-14 05:26:30,616 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 05:26:30,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:26:30,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-14 05:26:30,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:26:31,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 05:26:31,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:31,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-12-14 05:26:31,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:31,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:26:32,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:26:32,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 05:26:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:26:32,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:26:32,187 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5664 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5664) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-12-14 05:26:32,333 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5664 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5664) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 16)) 9223372039002259456))) is different from false [2022-12-14 05:26:32,339 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5664 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5664) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 20)) 9223372039002259456))) is different from false [2022-12-14 05:26:32,420 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5664 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5664) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 28)) 9223372039002259456))) is different from false [2022-12-14 05:26:32,499 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5664 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5664) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 36)) 9223372039002259456))) is different from false [2022-12-14 05:26:32,504 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5664 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5664) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 40)) 9223372039002259456))) is different from false [2022-12-14 05:26:32,509 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5664 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5664) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 44))))) is different from false [2022-12-14 05:26:32,514 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5664 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5664) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 48)) 9223372039002259456))) is different from false [2022-12-14 05:26:32,519 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5664 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_5664) c_~A~0.base) (+ c_~A~0.offset 48)) 9223372039002259456))) is different from false [2022-12-14 05:26:32,711 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 05:26:32,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-12-14 05:26:32,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:26:32,717 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 159 treesize of output 149 [2022-12-14 05:26:32,722 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 67 treesize of output 59 [2022-12-14 05:26:32,725 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 126 treesize of output 110 [2022-12-14 05:26:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 128 not checked. [2022-12-14 05:26:33,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296751766] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:26:33,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1632402453] [2022-12-14 05:26:33,267 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-12-14 05:26:33,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:26:33,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2022-12-14 05:26:33,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285681439] [2022-12-14 05:26:33,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:26:33,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-12-14 05:26:33,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:26:33,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-12-14 05:26:33,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=6283, Unknown=97, NotChecked=1512, Total=8190 [2022-12-14 05:26:33,268 INFO L87 Difference]: Start difference. First operand 9883 states and 33045 transitions. Second operand has 91 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 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)