./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur --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 54b834084fe1393c06cef2b14fb31f788537bd44a8744d5b4241cffc72e1d744 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 01:06:38,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:06:38,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:06:38,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:06:38,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:06:38,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:06:38,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:06:38,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:06:38,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:06:38,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:06:38,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:06:38,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:06:38,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:06:38,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:06:38,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:06:38,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:06:38,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:06:38,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:06:38,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:06:38,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:06:38,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:06:38,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:06:38,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:06:38,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:06:38,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:06:38,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:06:38,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:06:38,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:06:38,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:06:38,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:06:38,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:06:38,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:06:38,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:06:38,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:06:38,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:06:38,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:06:38,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:06:38,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:06:38,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:06:38,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:06:38,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:06:38,203 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 01:06:38,254 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:06:38,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:06:38,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:06:38,256 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:06:38,257 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:06:38,257 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:06:38,258 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:06:38,258 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:06:38,259 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:06:38,259 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:06:38,260 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:06:38,261 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:06:38,261 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:06:38,262 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:06:38,262 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:06:38,262 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:06:38,263 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:06:38,263 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:06:38,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:06:38,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 01:06:38,265 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 01:06:38,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:06:38,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 01:06:38,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:06:38,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 01:06:38,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:06:38,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 01:06:38,268 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 01:06:38,268 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 01:06:38,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 01:06:38,269 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:06:38,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 01:06:38,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:06:38,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:06:38,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:06:38,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:06:38,273 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:06:38,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:06:38,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 01:06:38,273 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:06:38,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:06:38,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 01:06:38,274 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:06:38,275 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_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 54b834084fe1393c06cef2b14fb31f788537bd44a8744d5b4241cffc72e1d744 [2022-11-26 01:06:38,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:06:38,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:06:38,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:06:38,721 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:06:38,722 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:06:38,723 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2022-11-26 01:06:42,348 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:06:42,673 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:06:42,674 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2022-11-26 01:06:42,682 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/data/e031a159c/ce030b846e104758a62dcefe7fe39789/FLAG580cd745e [2022-11-26 01:06:42,699 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/data/e031a159c/ce030b846e104758a62dcefe7fe39789 [2022-11-26 01:06:42,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:06:42,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:06:42,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:06:42,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:06:42,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:06:42,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:06:42" (1/1) ... [2022-11-26 01:06:42,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e67c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:42, skipping insertion in model container [2022-11-26 01:06:42,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:06:42" (1/1) ... [2022-11-26 01:06:42,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:06:42,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:06:42,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:42,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:42,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:42,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:42,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:42,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:42,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:42,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:42,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:42,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:42,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:42,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:42,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:42,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:42,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:42,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:42,997 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_81c3bada-8245-4422-b454-205b8c9512f4/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c[3642,3655] [2022-11-26 01:06:43,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:06:43,035 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:06:43,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:43,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:43,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:43,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:43,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:43,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:43,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:43,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:43,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:43,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:43,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:43,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:43,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:43,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:43,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-26 01:06:43,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-26 01:06:43,118 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_81c3bada-8245-4422-b454-205b8c9512f4/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c[3642,3655] [2022-11-26 01:06:43,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:06:43,154 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:06:43,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43 WrapperNode [2022-11-26 01:06:43,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:06:43,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:06:43,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:06:43,157 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:06:43,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43" (1/1) ... [2022-11-26 01:06:43,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43" (1/1) ... [2022-11-26 01:06:43,224 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 365 [2022-11-26 01:06:43,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:06:43,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:06:43,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:06:43,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:06:43,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43" (1/1) ... [2022-11-26 01:06:43,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43" (1/1) ... [2022-11-26 01:06:43,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43" (1/1) ... [2022-11-26 01:06:43,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43" (1/1) ... [2022-11-26 01:06:43,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43" (1/1) ... [2022-11-26 01:06:43,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43" (1/1) ... [2022-11-26 01:06:43,268 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43" (1/1) ... [2022-11-26 01:06:43,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43" (1/1) ... [2022-11-26 01:06:43,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:06:43,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:06:43,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:06:43,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:06:43,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43" (1/1) ... [2022-11-26 01:06:43,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:06:43,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:06:43,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:06:43,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:06:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:06:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 01:06:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 01:06:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 01:06:43,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-26 01:06:43,393 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-26 01:06:43,393 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-26 01:06:43,393 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-26 01:06:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-26 01:06:43,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-26 01:06:43,394 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-26 01:06:43,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-26 01:06:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 01:06:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-26 01:06:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-26 01:06:43,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 01:06:43,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:06:43,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:06:43,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 01:06:43,398 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-26 01:06:43,656 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:06:43,659 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:06:44,523 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:06:45,376 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:06:45,376 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-26 01:06:45,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:06:45 BoogieIcfgContainer [2022-11-26 01:06:45,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:06:45,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:06:45,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:06:45,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:06:45,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:06:42" (1/3) ... [2022-11-26 01:06:45,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7436cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:06:45, skipping insertion in model container [2022-11-26 01:06:45,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:43" (2/3) ... [2022-11-26 01:06:45,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7436cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:06:45, skipping insertion in model container [2022-11-26 01:06:45,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:06:45" (3/3) ... [2022-11-26 01:06:45,395 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2022-11-26 01:06:45,407 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-26 01:06:45,420 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:06:45,421 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-11-26 01:06:45,421 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-26 01:06:45,694 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-26 01:06:45,750 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-26 01:06:45,790 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 243 places, 245 transitions, 522 flow [2022-11-26 01:06:45,797 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 243 places, 245 transitions, 522 flow [2022-11-26 01:06:45,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 245 transitions, 522 flow [2022-11-26 01:06:46,037 INFO L130 PetriNetUnfolder]: 15/241 cut-off events. [2022-11-26 01:06:46,037 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-26 01:06:46,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 241 events. 15/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 259 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 194. Up to 2 conditions per place. [2022-11-26 01:06:46,055 INFO L119 LiptonReduction]: Number of co-enabled transitions 5712 [2022-11-26 01:07:13,119 INFO L134 LiptonReduction]: Checked pairs total: 20231 [2022-11-26 01:07:13,120 INFO L136 LiptonReduction]: Total number of compositions: 260 [2022-11-26 01:07:13,130 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 71 transitions, 174 flow [2022-11-26 01:07:15,254 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35133 states, 28569 states have (on average 5.4109699324442575) internal successors, (154586), 35132 states have internal predecessors, (154586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:15,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:07:15,297 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;@3e1c7c91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:07:15,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-11-26 01:07:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 35133 states, 28569 states have (on average 5.4109699324442575) internal successors, (154586), 35132 states have internal predecessors, (154586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-26 01:07:15,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:15,365 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-26 01:07:15,366 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:15,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:15,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1558, now seen corresponding path program 1 times [2022-11-26 01:07:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:15,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307624600] [2022-11-26 01:07:15,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:15,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:15,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:15,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307624600] [2022-11-26 01:07:15,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307624600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:15,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:15,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-26 01:07:15,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460845085] [2022-11-26 01:07:15,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:15,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 01:07:15,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:15,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 01:07:15,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 01:07:15,801 INFO L87 Difference]: Start difference. First operand has 35133 states, 28569 states have (on average 5.4109699324442575) internal successors, (154586), 35132 states have internal predecessors, (154586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:16,436 INFO L93 Difference]: Finished difference Result 16395 states and 71736 transitions. [2022-11-26 01:07:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 01:07:16,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-26 01:07:16,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:16,862 INFO L225 Difference]: With dead ends: 16395 [2022-11-26 01:07:16,863 INFO L226 Difference]: Without dead ends: 16395 [2022-11-26 01:07:16,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 01:07:16,868 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:16,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16395 states. [2022-11-26 01:07:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16395 to 16395. [2022-11-26 01:07:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16395 states, 13993 states have (on average 5.12656328164082) internal successors, (71736), 16394 states have internal predecessors, (71736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16395 states to 16395 states and 71736 transitions. [2022-11-26 01:07:18,777 INFO L78 Accepts]: Start accepts. Automaton has 16395 states and 71736 transitions. Word has length 1 [2022-11-26 01:07:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:18,778 INFO L495 AbstractCegarLoop]: Abstraction has 16395 states and 71736 transitions. [2022-11-26 01:07:18,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:18,785 INFO L276 IsEmpty]: Start isEmpty. Operand 16395 states and 71736 transitions. [2022-11-26 01:07:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-26 01:07:18,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:18,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-26 01:07:18,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:07:18,787 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:18,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:18,788 INFO L85 PathProgramCache]: Analyzing trace with hash 49851, now seen corresponding path program 1 times [2022-11-26 01:07:18,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:18,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774454726] [2022-11-26 01:07:18,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:19,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:19,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774454726] [2022-11-26 01:07:19,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774454726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:19,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:19,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:07:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533022156] [2022-11-26 01:07:19,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:19,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:19,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:19,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:19,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:19,023 INFO L87 Difference]: Start difference. First operand 16395 states and 71736 transitions. 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-11-26 01:07:20,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:20,585 INFO L93 Difference]: Finished difference Result 32787 states and 143469 transitions. [2022-11-26 01:07:20,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:20,586 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-11-26 01:07:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:21,550 INFO L225 Difference]: With dead ends: 32787 [2022-11-26 01:07:21,551 INFO L226 Difference]: Without dead ends: 32787 [2022-11-26 01:07:21,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:21,553 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:21,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:07:21,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32787 states. [2022-11-26 01:07:22,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32787 to 16396. [2022-11-26 01:07:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16396 states, 13994 states have (on average 5.126339859939974) internal successors, (71738), 16395 states have internal predecessors, (71738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16396 states to 16396 states and 71738 transitions. [2022-11-26 01:07:23,217 INFO L78 Accepts]: Start accepts. Automaton has 16396 states and 71738 transitions. Word has length 2 [2022-11-26 01:07:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:23,217 INFO L495 AbstractCegarLoop]: Abstraction has 16396 states and 71738 transitions. [2022-11-26 01:07:23,218 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-11-26 01:07:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 16396 states and 71738 transitions. [2022-11-26 01:07:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 01:07:23,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:23,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 01:07:23,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 01:07:23,219 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:23,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1548205, now seen corresponding path program 1 times [2022-11-26 01:07:23,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:23,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547798281] [2022-11-26 01:07:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:23,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:23,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547798281] [2022-11-26 01:07:23,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547798281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:23,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:23,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:07:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508221] [2022-11-26 01:07:23,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:23,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:23,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:23,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:23,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:23,411 INFO L87 Difference]: Start difference. First operand 16396 states and 71738 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-11-26 01:07:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:23,752 INFO L93 Difference]: Finished difference Result 16395 states and 71737 transitions. [2022-11-26 01:07:23,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:23,753 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-11-26 01:07:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:24,154 INFO L225 Difference]: With dead ends: 16395 [2022-11-26 01:07:24,154 INFO L226 Difference]: Without dead ends: 16395 [2022-11-26 01:07:24,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:24,156 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:24,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16395 states. [2022-11-26 01:07:25,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16395 to 16395. [2022-11-26 01:07:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16395 states, 13994 states have (on average 5.126268400743176) internal successors, (71737), 16394 states have internal predecessors, (71737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:25,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16395 states to 16395 states and 71737 transitions. [2022-11-26 01:07:25,206 INFO L78 Accepts]: Start accepts. Automaton has 16395 states and 71737 transitions. Word has length 3 [2022-11-26 01:07:25,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:25,207 INFO L495 AbstractCegarLoop]: Abstraction has 16395 states and 71737 transitions. [2022-11-26 01:07:25,207 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-11-26 01:07:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 16395 states and 71737 transitions. [2022-11-26 01:07:25,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 01:07:25,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:25,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 01:07:25,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 01:07:25,209 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:25,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1548248, now seen corresponding path program 1 times [2022-11-26 01:07:25,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:25,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511742262] [2022-11-26 01:07:25,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:25,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:25,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:25,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511742262] [2022-11-26 01:07:25,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511742262] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:25,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292248490] [2022-11-26 01:07:25,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:25,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:25,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:25,374 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:25,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:07:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:25,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 01:07:25,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:25,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:25,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292248490] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:25,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [778646559] [2022-11-26 01:07:25,802 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-11-26 01:07:25,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:25,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-11-26 01:07:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10665535] [2022-11-26 01:07:25,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:25,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 01:07:25,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 01:07:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:07:25,808 INFO L87 Difference]: Start difference. First operand 16395 states and 71737 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-11-26 01:07:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:28,119 INFO L93 Difference]: Finished difference Result 81962 states and 358667 transitions. [2022-11-26 01:07:28,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:07:28,120 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-11-26 01:07:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:29,497 INFO L225 Difference]: With dead ends: 81962 [2022-11-26 01:07:29,497 INFO L226 Difference]: Without dead ends: 81962 [2022-11-26 01:07:29,498 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-11-26 01:07:29,503 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 255 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:29,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 0 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 01:07:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81962 states. [2022-11-26 01:07:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81962 to 16398. [2022-11-26 01:07:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16398 states, 13997 states have (on average 5.125598342501965) internal successors, (71743), 16397 states have internal predecessors, (71743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16398 states to 16398 states and 71743 transitions. [2022-11-26 01:07:31,861 INFO L78 Accepts]: Start accepts. Automaton has 16398 states and 71743 transitions. Word has length 3 [2022-11-26 01:07:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:31,862 INFO L495 AbstractCegarLoop]: Abstraction has 16398 states and 71743 transitions. [2022-11-26 01:07:31,862 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-11-26 01:07:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 16398 states and 71743 transitions. [2022-11-26 01:07:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 01:07:31,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:31,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 01:07:31,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 01:07:32,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:32,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:32,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:32,065 INFO L85 PathProgramCache]: Analyzing trace with hash 48009728, now seen corresponding path program 1 times [2022-11-26 01:07:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:32,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362067508] [2022-11-26 01:07:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:32,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:32,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362067508] [2022-11-26 01:07:32,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362067508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:32,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:32,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:07:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175689125] [2022-11-26 01:07:32,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:32,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:32,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:32,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:32,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:32,213 INFO L87 Difference]: Start difference. First operand 16398 states and 71743 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:33,010 INFO L93 Difference]: Finished difference Result 13140 states and 57372 transitions. [2022-11-26 01:07:33,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:33,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-26 01:07:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:33,117 INFO L225 Difference]: With dead ends: 13140 [2022-11-26 01:07:33,117 INFO L226 Difference]: Without dead ends: 13140 [2022-11-26 01:07:33,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:33,120 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:33,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:07:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13140 states. [2022-11-26 01:07:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13140 to 13140. [2022-11-26 01:07:33,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13140 states, 11376 states have (on average 5.043248945147679) internal successors, (57372), 13139 states have internal predecessors, (57372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13140 states to 13140 states and 57372 transitions. [2022-11-26 01:07:33,666 INFO L78 Accepts]: Start accepts. Automaton has 13140 states and 57372 transitions. Word has length 4 [2022-11-26 01:07:33,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:33,668 INFO L495 AbstractCegarLoop]: Abstraction has 13140 states and 57372 transitions. [2022-11-26 01:07:33,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 13140 states and 57372 transitions. [2022-11-26 01:07:33,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 01:07:33,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:33,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 01:07:33,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 01:07:33,670 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:33,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash 48009729, now seen corresponding path program 1 times [2022-11-26 01:07:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:33,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3392137] [2022-11-26 01:07:33,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:33,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:33,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:33,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3392137] [2022-11-26 01:07:33,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3392137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:33,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:33,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:07:33,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297238100] [2022-11-26 01:07:33,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:33,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:33,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:33,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:33,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:33,884 INFO L87 Difference]: Start difference. First operand 13140 states and 57372 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:34,202 INFO L93 Difference]: Finished difference Result 14368 states and 64183 transitions. [2022-11-26 01:07:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:34,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-26 01:07:34,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:34,761 INFO L225 Difference]: With dead ends: 14368 [2022-11-26 01:07:34,761 INFO L226 Difference]: Without dead ends: 14368 [2022-11-26 01:07:34,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:34,775 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:34,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:07:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14368 states. [2022-11-26 01:07:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14368 to 13852. [2022-11-26 01:07:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13852 states, 12088 states have (on average 5.191346790205162) internal successors, (62753), 13851 states have internal predecessors, (62753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13852 states to 13852 states and 62753 transitions. [2022-11-26 01:07:35,214 INFO L78 Accepts]: Start accepts. Automaton has 13852 states and 62753 transitions. Word has length 4 [2022-11-26 01:07:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:35,214 INFO L495 AbstractCegarLoop]: Abstraction has 13852 states and 62753 transitions. [2022-11-26 01:07:35,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:35,214 INFO L276 IsEmpty]: Start isEmpty. Operand 13852 states and 62753 transitions. [2022-11-26 01:07:35,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 01:07:35,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:35,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 01:07:35,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 01:07:35,215 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:35,216 INFO L85 PathProgramCache]: Analyzing trace with hash 48009818, now seen corresponding path program 1 times [2022-11-26 01:07:35,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:35,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835814630] [2022-11-26 01:07:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:35,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:35,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835814630] [2022-11-26 01:07:35,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835814630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:35,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:35,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:07:35,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662917267] [2022-11-26 01:07:35,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:35,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:35,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:35,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:35,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:35,340 INFO L87 Difference]: Start difference. First operand 13852 states and 62753 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:35,543 INFO L93 Difference]: Finished difference Result 10958 states and 49104 transitions. [2022-11-26 01:07:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:35,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-26 01:07:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:35,601 INFO L225 Difference]: With dead ends: 10958 [2022-11-26 01:07:35,601 INFO L226 Difference]: Without dead ends: 10958 [2022-11-26 01:07:35,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:35,602 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 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.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:35,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:35,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10958 states. [2022-11-26 01:07:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10958 to 10958. [2022-11-26 01:07:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10958 states, 9733 states have (on average 5.045104284393301) internal successors, (49104), 10957 states have internal predecessors, (49104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:36,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10958 states to 10958 states and 49104 transitions. [2022-11-26 01:07:36,344 INFO L78 Accepts]: Start accepts. Automaton has 10958 states and 49104 transitions. Word has length 4 [2022-11-26 01:07:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:36,344 INFO L495 AbstractCegarLoop]: Abstraction has 10958 states and 49104 transitions. [2022-11-26 01:07:36,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 10958 states and 49104 transitions. [2022-11-26 01:07:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 01:07:36,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:36,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 01:07:36,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 01:07:36,345 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash 48009819, now seen corresponding path program 1 times [2022-11-26 01:07:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:36,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540669777] [2022-11-26 01:07:36,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:36,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:36,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:36,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540669777] [2022-11-26 01:07:36,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540669777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:36,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:36,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:07:36,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896275503] [2022-11-26 01:07:36,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:36,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:36,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:36,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:36,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:36,444 INFO L87 Difference]: Start difference. First operand 10958 states and 49104 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:36,616 INFO L93 Difference]: Finished difference Result 8428 states and 37069 transitions. [2022-11-26 01:07:36,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:36,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-26 01:07:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:36,679 INFO L225 Difference]: With dead ends: 8428 [2022-11-26 01:07:36,679 INFO L226 Difference]: Without dead ends: 8428 [2022-11-26 01:07:36,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:36,681 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:36,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:36,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8428 states. [2022-11-26 01:07:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8428 to 8428. [2022-11-26 01:07:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8428 states, 7644 states have (on average 4.849424385138671) internal successors, (37069), 8427 states have internal predecessors, (37069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 37069 transitions. [2022-11-26 01:07:36,982 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 37069 transitions. Word has length 4 [2022-11-26 01:07:36,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:36,982 INFO L495 AbstractCegarLoop]: Abstraction has 8428 states and 37069 transitions. [2022-11-26 01:07:36,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 37069 transitions. [2022-11-26 01:07:36,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 01:07:36,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:36,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 01:07:36,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 01:07:36,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1488302739, now seen corresponding path program 1 times [2022-11-26 01:07:36,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:36,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738570647] [2022-11-26 01:07:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:37,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:37,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738570647] [2022-11-26 01:07:37,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738570647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:37,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:37,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:07:37,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098634552] [2022-11-26 01:07:37,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:37,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:07:37,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:37,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:07:37,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:37,209 INFO L87 Difference]: Start difference. First operand 8428 states and 37069 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:37,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:37,875 INFO L93 Difference]: Finished difference Result 9657 states and 41205 transitions. [2022-11-26 01:07:37,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:07:37,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-26 01:07:37,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:37,961 INFO L225 Difference]: With dead ends: 9657 [2022-11-26 01:07:37,961 INFO L226 Difference]: Without dead ends: 9649 [2022-11-26 01:07:37,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:07:37,963 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:37,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 01:07:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9649 states. [2022-11-26 01:07:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9649 to 9133. [2022-11-26 01:07:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9133 states, 8349 states have (on average 4.761049227452389) internal successors, (39750), 9132 states have internal predecessors, (39750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9133 states to 9133 states and 39750 transitions. [2022-11-26 01:07:38,339 INFO L78 Accepts]: Start accepts. Automaton has 9133 states and 39750 transitions. Word has length 5 [2022-11-26 01:07:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:38,339 INFO L495 AbstractCegarLoop]: Abstraction has 9133 states and 39750 transitions. [2022-11-26 01:07:38,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 9133 states and 39750 transitions. [2022-11-26 01:07:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 01:07:38,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:38,340 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-11-26 01:07:38,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 01:07:38,340 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:38,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:38,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1119260826, now seen corresponding path program 2 times [2022-11-26 01:07:38,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:38,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664170142] [2022-11-26 01:07:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:38,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:38,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:38,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:38,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664170142] [2022-11-26 01:07:38,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664170142] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:38,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109985790] [2022-11-26 01:07:38,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:07:38,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:38,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:38,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:38,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:07:38,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-26 01:07:38,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:07:38,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 01:07:38,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 01:07:38,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:38,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109985790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:38,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:38,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-26 01:07:38,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741903598] [2022-11-26 01:07:38,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:38,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:38,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:38,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:38,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:07:38,808 INFO L87 Difference]: Start difference. First operand 9133 states and 39750 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-11-26 01:07:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:39,040 INFO L93 Difference]: Finished difference Result 9132 states and 39749 transitions. [2022-11-26 01:07:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:39,041 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-11-26 01:07:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:39,134 INFO L225 Difference]: With dead ends: 9132 [2022-11-26 01:07:39,135 INFO L226 Difference]: Without dead ends: 9132 [2022-11-26 01:07:39,136 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-11-26 01:07:39,138 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:39,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9132 states. [2022-11-26 01:07:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9132 to 9129. [2022-11-26 01:07:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9129 states, 8346 states have (on average 4.7619218787443085) internal successors, (39743), 9128 states have internal predecessors, (39743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9129 states to 9129 states and 39743 transitions. [2022-11-26 01:07:39,670 INFO L78 Accepts]: Start accepts. Automaton has 9129 states and 39743 transitions. Word has length 6 [2022-11-26 01:07:39,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:39,671 INFO L495 AbstractCegarLoop]: Abstraction has 9129 states and 39743 transitions. [2022-11-26 01:07:39,671 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-11-26 01:07:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 9129 states and 39743 transitions. [2022-11-26 01:07:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 01:07:39,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:39,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 01:07:39,679 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:39,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 01:07:39,873 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:39,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:39,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1118873503, now seen corresponding path program 1 times [2022-11-26 01:07:39,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:39,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110666490] [2022-11-26 01:07:39,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:39,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:40,217 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:40,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110666490] [2022-11-26 01:07:40,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110666490] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:40,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660969047] [2022-11-26 01:07:40,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:40,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:40,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:40,220 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:40,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:07:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:40,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-26 01:07:40,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:40,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:40,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:40,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660969047] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:40,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1373859276] [2022-11-26 01:07:40,728 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:07:40,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:40,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-26 01:07:40,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291295708] [2022-11-26 01:07:40,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:40,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 01:07:40,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:40,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 01:07:40,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-26 01:07:40,735 INFO L87 Difference]: Start difference. First operand 9129 states and 39743 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:41,643 INFO L93 Difference]: Finished difference Result 10379 states and 43623 transitions. [2022-11-26 01:07:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 01:07:41,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 01:07:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:41,711 INFO L225 Difference]: With dead ends: 10379 [2022-11-26 01:07:41,712 INFO L226 Difference]: Without dead ends: 10371 [2022-11-26 01:07:41,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2022-11-26 01:07:41,713 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 314 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:41,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 0 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 01:07:41,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10371 states. [2022-11-26 01:07:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10371 to 9178. [2022-11-26 01:07:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9178 states, 8395 states have (on average 4.7821322215604525) internal successors, (40146), 9177 states have internal predecessors, (40146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9178 states to 9178 states and 40146 transitions. [2022-11-26 01:07:42,067 INFO L78 Accepts]: Start accepts. Automaton has 9178 states and 40146 transitions. Word has length 6 [2022-11-26 01:07:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:42,068 INFO L495 AbstractCegarLoop]: Abstraction has 9178 states and 40146 transitions. [2022-11-26 01:07:42,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 9178 states and 40146 transitions. [2022-11-26 01:07:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 01:07:42,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:42,069 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-11-26 01:07:42,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:42,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:42,270 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:42,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash -336958381, now seen corresponding path program 2 times [2022-11-26 01:07:42,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:42,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511376979] [2022-11-26 01:07:42,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:42,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:43,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:43,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511376979] [2022-11-26 01:07:43,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511376979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:43,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670828411] [2022-11-26 01:07:43,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:07:43,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:43,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:43,051 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:43,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 01:07:43,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 01:07:43,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:07:43,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-26 01:07:43,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:43,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:07:43,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:43,578 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-11-26 01:07:43,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-26 01:07:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:43,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:43,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:07:43,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-26 01:07:43,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:07:43,808 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-11-26 01:07:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:43,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670828411] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:43,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [434602829] [2022-11-26 01:07:43,893 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:07:43,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:43,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-11-26 01:07:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239305969] [2022-11-26 01:07:43,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:43,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 01:07:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 01:07:43,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=199, Unknown=3, NotChecked=0, Total=240 [2022-11-26 01:07:43,897 INFO L87 Difference]: Start difference. First operand 9178 states and 40146 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-11-26 01:07:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:45,121 INFO L93 Difference]: Finished difference Result 15891 states and 68459 transitions. [2022-11-26 01:07:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 01:07:45,122 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-11-26 01:07:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:45,222 INFO L225 Difference]: With dead ends: 15891 [2022-11-26 01:07:45,222 INFO L226 Difference]: Without dead ends: 15891 [2022-11-26 01:07:45,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=373, Unknown=3, NotChecked=0, Total=462 [2022-11-26 01:07:45,224 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 446 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:45,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 0 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 01:07:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15891 states. [2022-11-26 01:07:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15891 to 10272. [2022-11-26 01:07:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10272 states, 9489 states have (on average 4.856781536515966) internal successors, (46086), 10271 states have internal predecessors, (46086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10272 states to 10272 states and 46086 transitions. [2022-11-26 01:07:45,916 INFO L78 Accepts]: Start accepts. Automaton has 10272 states and 46086 transitions. Word has length 7 [2022-11-26 01:07:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:45,917 INFO L495 AbstractCegarLoop]: Abstraction has 10272 states and 46086 transitions. [2022-11-26 01:07:45,917 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-11-26 01:07:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 10272 states and 46086 transitions. [2022-11-26 01:07:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 01:07:45,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:45,918 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-11-26 01:07:45,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:46,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 01:07:46,119 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -336958380, now seen corresponding path program 1 times [2022-11-26 01:07:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:46,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754880173] [2022-11-26 01:07:46,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:46,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:46,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:46,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754880173] [2022-11-26 01:07:46,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754880173] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:46,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035402882] [2022-11-26 01:07:46,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:46,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:46,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:46,677 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:46,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:07:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:46,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-26 01:07:46,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:47,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:07:47,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:47,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 16 treesize of output 18 [2022-11-26 01:07:47,155 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-26 01:07:47,155 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 22 treesize of output 10 [2022-11-26 01:07:47,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:47,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:47,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:07:47,310 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-11-26 01:07:47,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:07:47,321 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-11-26 01:07:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:47,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035402882] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:47,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1335046864] [2022-11-26 01:07:47,396 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:07:47,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:47,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-11-26 01:07:47,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871697238] [2022-11-26 01:07:47,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:47,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 01:07:47,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:47,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 01:07:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=225, Unknown=5, NotChecked=0, Total=272 [2022-11-26 01:07:47,399 INFO L87 Difference]: Start difference. First operand 10272 states and 46086 transitions. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:48,707 INFO L93 Difference]: Finished difference Result 19623 states and 82844 transitions. [2022-11-26 01:07:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 01:07:48,708 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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 7 [2022-11-26 01:07:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:48,813 INFO L225 Difference]: With dead ends: 19623 [2022-11-26 01:07:48,813 INFO L226 Difference]: Without dead ends: 19623 [2022-11-26 01:07:48,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=524, Unknown=5, NotChecked=0, Total=650 [2022-11-26 01:07:48,815 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 537 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:48,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 0 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 01:07:48,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19623 states. [2022-11-26 01:07:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19623 to 10272. [2022-11-26 01:07:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10272 states, 9489 states have (on average 4.741490146485404) internal successors, (44992), 10271 states have internal predecessors, (44992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10272 states to 10272 states and 44992 transitions. [2022-11-26 01:07:49,465 INFO L78 Accepts]: Start accepts. Automaton has 10272 states and 44992 transitions. Word has length 7 [2022-11-26 01:07:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:49,465 INFO L495 AbstractCegarLoop]: Abstraction has 10272 states and 44992 transitions. [2022-11-26 01:07:49,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 10272 states and 44992 transitions. [2022-11-26 01:07:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 01:07:49,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:49,467 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:49,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:49,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 01:07:49,669 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:49,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:49,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1855698966, now seen corresponding path program 1 times [2022-11-26 01:07:49,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:49,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426555099] [2022-11-26 01:07:49,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:49,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:50,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:50,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426555099] [2022-11-26 01:07:50,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426555099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:50,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009488190] [2022-11-26 01:07:50,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:50,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:50,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:50,355 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:50,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 01:07:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:50,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-26 01:07:50,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:50,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:07:50,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:50,786 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-11-26 01:07:50,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:50,837 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-11-26 01:07:50,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-26 01:07:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:50,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:50,936 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_482 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_482) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 9223372039002259456))) is different from false [2022-11-26 01:07:51,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:07:51,028 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-11-26 01:07:51,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:07:51,042 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-11-26 01:07:51,049 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-11-26 01:07:51,056 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-11-26 01:07:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:51,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009488190] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:51,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1758331484] [2022-11-26 01:07:51,214 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:07:51,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:51,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-11-26 01:07:51,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595621599] [2022-11-26 01:07:51,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:51,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 01:07:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:51,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 01:07:51,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=256, Unknown=6, NotChecked=32, Total=342 [2022-11-26 01:07:51,218 INFO L87 Difference]: Start difference. First operand 10272 states and 44992 transitions. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:52,722 INFO L93 Difference]: Finished difference Result 16985 states and 73303 transitions. [2022-11-26 01:07:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 01:07:52,723 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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-11-26 01:07:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:52,843 INFO L225 Difference]: With dead ends: 16985 [2022-11-26 01:07:52,844 INFO L226 Difference]: Without dead ends: 16985 [2022-11-26 01:07:52,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=452, Unknown=6, NotChecked=44, Total=600 [2022-11-26 01:07:52,845 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 562 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:52,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 0 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 791 Invalid, 0 Unknown, 129 Unchecked, 0.9s Time] [2022-11-26 01:07:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16985 states. [2022-11-26 01:07:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16985 to 11365. [2022-11-26 01:07:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11365 states, 10582 states have (on average 4.812795312795313) internal successors, (50929), 11364 states have internal predecessors, (50929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11365 states to 11365 states and 50929 transitions. [2022-11-26 01:07:53,605 INFO L78 Accepts]: Start accepts. Automaton has 11365 states and 50929 transitions. Word has length 8 [2022-11-26 01:07:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:53,606 INFO L495 AbstractCegarLoop]: Abstraction has 11365 states and 50929 transitions. [2022-11-26 01:07:53,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 11365 states and 50929 transitions. [2022-11-26 01:07:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 01:07:53,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:53,607 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:53,614 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:53,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:53,808 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:53,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:53,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1855698965, now seen corresponding path program 1 times [2022-11-26 01:07:53,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:53,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083729926] [2022-11-26 01:07:53,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:53,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:54,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:54,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083729926] [2022-11-26 01:07:54,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083729926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:54,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771912356] [2022-11-26 01:07:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:54,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:54,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:54,518 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:54,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 01:07:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:54,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-26 01:07:54,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:54,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:07:54,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:54,982 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-11-26 01:07:55,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:55,053 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-11-26 01:07:55,098 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-26 01:07:55,099 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 22 treesize of output 10 [2022-11-26 01:07:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:55,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:55,204 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_542 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_542) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-11-26 01:07:55,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:07:55,306 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-11-26 01:07:55,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:07:55,334 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-11-26 01:07:55,348 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-11-26 01:07:55,358 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 55 treesize of output 47 [2022-11-26 01:07:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:55,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771912356] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:55,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1595423173] [2022-11-26 01:07:55,505 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:07:55,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:55,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-26 01:07:55,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901387282] [2022-11-26 01:07:55,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:55,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 01:07:55,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:55,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 01:07:55,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=292, Unknown=2, NotChecked=34, Total=380 [2022-11-26 01:07:55,510 INFO L87 Difference]: Start difference. First operand 11365 states and 50929 transitions. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:57,489 INFO L93 Difference]: Finished difference Result 21808 states and 92530 transitions. [2022-11-26 01:07:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 01:07:57,490 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 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-11-26 01:07:57,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:57,681 INFO L225 Difference]: With dead ends: 21808 [2022-11-26 01:07:57,681 INFO L226 Difference]: Without dead ends: 21808 [2022-11-26 01:07:57,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=625, Unknown=2, NotChecked=52, Total=812 [2022-11-26 01:07:57,685 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 460 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:57,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 0 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 909 Invalid, 0 Unknown, 188 Unchecked, 1.1s Time] [2022-11-26 01:07:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21808 states. [2022-11-26 01:07:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21808 to 10272. [2022-11-26 01:07:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10272 states, 9489 states have (on average 4.741490146485404) internal successors, (44992), 10271 states have internal predecessors, (44992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10272 states to 10272 states and 44992 transitions. [2022-11-26 01:07:58,514 INFO L78 Accepts]: Start accepts. Automaton has 10272 states and 44992 transitions. Word has length 8 [2022-11-26 01:07:58,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:58,515 INFO L495 AbstractCegarLoop]: Abstraction has 10272 states and 44992 transitions. [2022-11-26 01:07:58,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 10272 states and 44992 transitions. [2022-11-26 01:07:58,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 01:07:58,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:58,516 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:58,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:58,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-26 01:07:58,725 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:58,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:58,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1855773671, now seen corresponding path program 1 times [2022-11-26 01:07:58,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:58,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718831791] [2022-11-26 01:07:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:58,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:58,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:58,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718831791] [2022-11-26 01:07:58,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718831791] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:58,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146871560] [2022-11-26 01:07:58,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:58,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:58,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:58,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:58,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 01:07:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:59,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 01:07:59,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 01:07:59,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:07:59,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146871560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:59,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 01:07:59,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-11-26 01:07:59,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260147384] [2022-11-26 01:07:59,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:59,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:59,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:59,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:59,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:07:59,290 INFO L87 Difference]: Start difference. First operand 10272 states and 44992 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-11-26 01:07:59,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:59,439 INFO L93 Difference]: Finished difference Result 6496 states and 28315 transitions. [2022-11-26 01:07:59,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:07:59,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 8 [2022-11-26 01:07:59,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:59,471 INFO L225 Difference]: With dead ends: 6496 [2022-11-26 01:07:59,471 INFO L226 Difference]: Without dead ends: 6496 [2022-11-26 01:07:59,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-26 01:07:59,472 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:59,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:07:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2022-11-26 01:07:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 5740. [2022-11-26 01:07:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5740 states, 5417 states have (on average 4.524460033228724) internal successors, (24509), 5739 states have internal predecessors, (24509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5740 states to 5740 states and 24509 transitions. [2022-11-26 01:07:59,626 INFO L78 Accepts]: Start accepts. Automaton has 5740 states and 24509 transitions. Word has length 8 [2022-11-26 01:07:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:59,626 INFO L495 AbstractCegarLoop]: Abstraction has 5740 states and 24509 transitions. [2022-11-26 01:07:59,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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-11-26 01:07:59,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5740 states and 24509 transitions. [2022-11-26 01:07:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 01:07:59,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:59,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:07:59,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-26 01:07:59,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-26 01:07:59,831 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:07:59,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:59,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1149276598, now seen corresponding path program 1 times [2022-11-26 01:07:59,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:59,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174528956] [2022-11-26 01:07:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:59,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:59,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:59,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174528956] [2022-11-26 01:07:59,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174528956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:07:59,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:07:59,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:07:59,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093251741] [2022-11-26 01:07:59,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:07:59,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:07:59,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:59,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:07:59,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:07:59,943 INFO L87 Difference]: Start difference. First operand 5740 states and 24509 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-11-26 01:08:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:00,078 INFO L93 Difference]: Finished difference Result 4472 states and 19040 transitions. [2022-11-26 01:08:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:08:00,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 8 [2022-11-26 01:08:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:00,098 INFO L225 Difference]: With dead ends: 4472 [2022-11-26 01:08:00,098 INFO L226 Difference]: Without dead ends: 4472 [2022-11-26 01:08:00,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:08:00,099 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:00,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:08:00,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4472 states. [2022-11-26 01:08:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4472 to 4472. [2022-11-26 01:08:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4472 states, 4248 states have (on average 4.482109227871939) internal successors, (19040), 4471 states have internal predecessors, (19040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4472 states to 4472 states and 19040 transitions. [2022-11-26 01:08:00,248 INFO L78 Accepts]: Start accepts. Automaton has 4472 states and 19040 transitions. Word has length 8 [2022-11-26 01:08:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:00,249 INFO L495 AbstractCegarLoop]: Abstraction has 4472 states and 19040 transitions. [2022-11-26 01:08:00,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-11-26 01:08:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 4472 states and 19040 transitions. [2022-11-26 01:08:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 01:08:00,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:00,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:00,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 01:08:00,250 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:00,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1149276600, now seen corresponding path program 1 times [2022-11-26 01:08:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:00,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941498591] [2022-11-26 01:08:00,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:00,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:00,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941498591] [2022-11-26 01:08:00,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941498591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:08:00,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:08:00,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:08:00,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875930103] [2022-11-26 01:08:00,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:08:00,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:08:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:00,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:08:00,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:08:00,327 INFO L87 Difference]: Start difference. First operand 4472 states and 19040 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-11-26 01:08:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:00,568 INFO L93 Difference]: Finished difference Result 3364 states and 14265 transitions. [2022-11-26 01:08:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:08:00,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 8 [2022-11-26 01:08:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:00,588 INFO L225 Difference]: With dead ends: 3364 [2022-11-26 01:08:00,588 INFO L226 Difference]: Without dead ends: 3364 [2022-11-26 01:08:00,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:08:00,589 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:00,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:08:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2022-11-26 01:08:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 3364. [2022-11-26 01:08:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3364 states, 3221 states have (on average 4.42874883576529) internal successors, (14265), 3363 states have internal predecessors, (14265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 14265 transitions. [2022-11-26 01:08:00,708 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 14265 transitions. Word has length 8 [2022-11-26 01:08:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:00,709 INFO L495 AbstractCegarLoop]: Abstraction has 3364 states and 14265 transitions. [2022-11-26 01:08:00,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-11-26 01:08:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 14265 transitions. [2022-11-26 01:08:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 01:08:00,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:00,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:00,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-26 01:08:00,711 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:00,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1149276554, now seen corresponding path program 1 times [2022-11-26 01:08:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:00,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414749747] [2022-11-26 01:08:00,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:00,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:00,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:00,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414749747] [2022-11-26 01:08:00,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414749747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:08:00,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:08:00,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:08:00,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875187258] [2022-11-26 01:08:00,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:08:00,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:08:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:00,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:08:00,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:08:00,766 INFO L87 Difference]: Start difference. First operand 3364 states and 14265 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-11-26 01:08:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:00,873 INFO L93 Difference]: Finished difference Result 2416 states and 10184 transitions. [2022-11-26 01:08:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:08:00,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 8 [2022-11-26 01:08:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:00,887 INFO L225 Difference]: With dead ends: 2416 [2022-11-26 01:08:00,888 INFO L226 Difference]: Without dead ends: 2416 [2022-11-26 01:08:00,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:08:00,889 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:00,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:08:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2022-11-26 01:08:00,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2416. [2022-11-26 01:08:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2416 states, 2336 states have (on average 4.359589041095891) internal successors, (10184), 2415 states have internal predecessors, (10184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 10184 transitions. [2022-11-26 01:08:00,973 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 10184 transitions. Word has length 8 [2022-11-26 01:08:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:00,973 INFO L495 AbstractCegarLoop]: Abstraction has 2416 states and 10184 transitions. [2022-11-26 01:08:00,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-11-26 01:08:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 10184 transitions. [2022-11-26 01:08:00,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:08:00,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:00,975 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:00,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-26 01:08:00,976 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1692206858, now seen corresponding path program 1 times [2022-11-26 01:08:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:00,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166504956] [2022-11-26 01:08:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:01,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:01,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166504956] [2022-11-26 01:08:01,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166504956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:01,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247181820] [2022-11-26 01:08:01,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:01,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:01,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:01,497 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:01,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 01:08:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:01,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-26 01:08:01,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:01,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:08:01,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:01,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-11-26 01:08:02,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:02,037 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-11-26 01:08:02,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-26 01:08:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:02,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:02,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:02,288 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-11-26 01:08:02,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:02,301 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-11-26 01:08:02,308 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-11-26 01:08:02,318 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-11-26 01:08:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:02,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247181820] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:02,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1486799167] [2022-11-26 01:08:02,463 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:08:02,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:02,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-11-26 01:08:02,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441667568] [2022-11-26 01:08:02,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:02,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 01:08:02,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:02,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 01:08:02,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=284, Unknown=6, NotChecked=0, Total=342 [2022-11-26 01:08:02,468 INFO L87 Difference]: Start difference. First operand 2416 states and 10184 transitions. Second operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:03,610 INFO L93 Difference]: Finished difference Result 4237 states and 17657 transitions. [2022-11-26 01:08:03,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 01:08:03,610 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 01:08:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:03,627 INFO L225 Difference]: With dead ends: 4237 [2022-11-26 01:08:03,627 INFO L226 Difference]: Without dead ends: 4237 [2022-11-26 01:08:03,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=491, Unknown=6, NotChecked=0, Total=600 [2022-11-26 01:08:03,629 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 454 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:03,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 0 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 01:08:03,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4237 states. [2022-11-26 01:08:03,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4237 to 2779. [2022-11-26 01:08:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2699 states have (on average 4.484623934790664) internal successors, (12104), 2778 states have internal predecessors, (12104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 12104 transitions. [2022-11-26 01:08:03,747 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 12104 transitions. Word has length 9 [2022-11-26 01:08:03,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:03,747 INFO L495 AbstractCegarLoop]: Abstraction has 2779 states and 12104 transitions. [2022-11-26 01:08:03,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 12104 transitions. [2022-11-26 01:08:03,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:08:03,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:03,749 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:03,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:03,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:03,956 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:03,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1692206857, now seen corresponding path program 1 times [2022-11-26 01:08:03,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:03,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792142378] [2022-11-26 01:08:03,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:03,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:04,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:04,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792142378] [2022-11-26 01:08:04,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792142378] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:04,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232528890] [2022-11-26 01:08:04,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:04,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:04,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:04,615 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:04,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 01:08:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:04,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-26 01:08:04,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:05,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:08:05,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:05,074 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-11-26 01:08:05,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:05,125 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-11-26 01:08:05,176 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-26 01:08:05,177 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 22 treesize of output 10 [2022-11-26 01:08:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:05,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:05,272 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_792 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_792) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-11-26 01:08:05,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:05,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-26 01:08:05,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:05,411 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-11-26 01:08:05,416 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-11-26 01:08:05,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 24 treesize of output 20 [2022-11-26 01:08:05,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:05,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232528890] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:05,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2116555694] [2022-11-26 01:08:05,530 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:08:05,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:05,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-11-26 01:08:05,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532567047] [2022-11-26 01:08:05,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:05,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 01:08:05,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:05,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 01:08:05,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=293, Unknown=1, NotChecked=34, Total=380 [2022-11-26 01:08:05,534 INFO L87 Difference]: Start difference. First operand 2779 states and 12104 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-11-26 01:08:06,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:06,884 INFO L93 Difference]: Finished difference Result 5359 states and 22075 transitions. [2022-11-26 01:08:06,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 01:08:06,884 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-11-26 01:08:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:06,911 INFO L225 Difference]: With dead ends: 5359 [2022-11-26 01:08:06,911 INFO L226 Difference]: Without dead ends: 5359 [2022-11-26 01:08:06,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=626, Unknown=1, NotChecked=52, Total=812 [2022-11-26 01:08:06,912 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 427 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:06,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 0 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 707 Invalid, 0 Unknown, 148 Unchecked, 0.8s Time] [2022-11-26 01:08:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5359 states. [2022-11-26 01:08:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5359 to 2779. [2022-11-26 01:08:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2699 states have (on average 4.351241200444609) internal successors, (11744), 2778 states have internal predecessors, (11744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 11744 transitions. [2022-11-26 01:08:07,000 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 11744 transitions. Word has length 9 [2022-11-26 01:08:07,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:07,000 INFO L495 AbstractCegarLoop]: Abstraction has 2779 states and 11744 transitions. [2022-11-26 01:08:07,000 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-11-26 01:08:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 11744 transitions. [2022-11-26 01:08:07,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:08:07,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:07,002 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-11-26 01:08:07,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:07,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:07,207 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:07,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1694407813, now seen corresponding path program 1 times [2022-11-26 01:08:07,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:07,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603562011] [2022-11-26 01:08:07,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:07,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:07,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:07,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603562011] [2022-11-26 01:08:07,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603562011] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:07,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436610663] [2022-11-26 01:08:07,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:07,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:07,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:07,481 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:07,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 01:08:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:07,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-26 01:08:07,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:07,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:08,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436610663] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:08,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1094752104] [2022-11-26 01:08:08,044 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:08:08,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:08,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-11-26 01:08:08,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811579323] [2022-11-26 01:08:08,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:08,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 01:08:08,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:08,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 01:08:08,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-26 01:08:08,049 INFO L87 Difference]: Start difference. First operand 2779 states and 11744 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:08,714 INFO L93 Difference]: Finished difference Result 5332 states and 21088 transitions. [2022-11-26 01:08:08,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 01:08:08,714 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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 9 [2022-11-26 01:08:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:08,735 INFO L225 Difference]: With dead ends: 5332 [2022-11-26 01:08:08,735 INFO L226 Difference]: Without dead ends: 5314 [2022-11-26 01:08:08,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2022-11-26 01:08:08,736 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 620 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:08,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 0 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:08:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2022-11-26 01:08:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 3849. [2022-11-26 01:08:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3769 states have (on average 4.4085964446802866) internal successors, (16616), 3848 states have internal predecessors, (16616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 16616 transitions. [2022-11-26 01:08:08,860 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 16616 transitions. Word has length 9 [2022-11-26 01:08:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:08,861 INFO L495 AbstractCegarLoop]: Abstraction has 3849 states and 16616 transitions. [2022-11-26 01:08:08,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 16616 transitions. [2022-11-26 01:08:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:08:08,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:08,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:08,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:09,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-26 01:08:09,066 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:09,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1267837437, now seen corresponding path program 1 times [2022-11-26 01:08:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:09,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251749498] [2022-11-26 01:08:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:09,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:09,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251749498] [2022-11-26 01:08:09,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251749498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:08:09,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:08:09,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:08:09,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182943424] [2022-11-26 01:08:09,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:08:09,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:08:09,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:09,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:08:09,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:08:09,207 INFO L87 Difference]: Start difference. First operand 3849 states and 16616 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:09,401 INFO L93 Difference]: Finished difference Result 3922 states and 16769 transitions. [2022-11-26 01:08:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:08:09,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 01:08:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:09,423 INFO L225 Difference]: With dead ends: 3922 [2022-11-26 01:08:09,424 INFO L226 Difference]: Without dead ends: 3849 [2022-11-26 01:08:09,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:08:09,425 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:09,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:08:09,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2022-11-26 01:08:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 3849. [2022-11-26 01:08:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3769 states have (on average 4.408331122313611) internal successors, (16615), 3848 states have internal predecessors, (16615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 16615 transitions. [2022-11-26 01:08:09,566 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 16615 transitions. Word has length 9 [2022-11-26 01:08:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:09,567 INFO L495 AbstractCegarLoop]: Abstraction has 3849 states and 16615 transitions. [2022-11-26 01:08:09,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 16615 transitions. [2022-11-26 01:08:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 01:08:09,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:09,568 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2022-11-26 01:08:09,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-26 01:08:09,568 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:09,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash 731345481, now seen corresponding path program 2 times [2022-11-26 01:08:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:09,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159350037] [2022-11-26 01:08:09,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:09,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:10,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:10,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159350037] [2022-11-26 01:08:10,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159350037] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:10,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148750156] [2022-11-26 01:08:10,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:08:10,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:10,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:10,143 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:10,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-26 01:08:10,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 01:08:10,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:08:10,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-26 01:08:10,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:10,788 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-11-26 01:08:10,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:10,874 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-11-26 01:08:11,043 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-26 01:08:11,044 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 25 treesize of output 12 [2022-11-26 01:08:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:11,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:11,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:11,331 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-11-26 01:08:11,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:11,346 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 49 treesize of output 46 [2022-11-26 01:08:11,354 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 16 treesize of output 9 [2022-11-26 01:08:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:11,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148750156] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:11,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [261829539] [2022-11-26 01:08:11,663 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:08:11,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:11,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-26 01:08:11,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108521928] [2022-11-26 01:08:11,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:11,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-26 01:08:11,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:11,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-26 01:08:11,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-11-26 01:08:11,665 INFO L87 Difference]: Start difference. First operand 3849 states and 16615 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:16,905 INFO L93 Difference]: Finished difference Result 6981 states and 28801 transitions. [2022-11-26 01:08:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-26 01:08:16,906 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 01:08:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:16,936 INFO L225 Difference]: With dead ends: 6981 [2022-11-26 01:08:16,936 INFO L226 Difference]: Without dead ends: 6981 [2022-11-26 01:08:16,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=459, Invalid=2621, Unknown=0, NotChecked=0, Total=3080 [2022-11-26 01:08:16,938 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 673 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:16,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 0 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-26 01:08:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6981 states. [2022-11-26 01:08:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6981 to 4206. [2022-11-26 01:08:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4206 states, 4126 states have (on average 4.4684924866698985) internal successors, (18437), 4205 states have internal predecessors, (18437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4206 states to 4206 states and 18437 transitions. [2022-11-26 01:08:17,083 INFO L78 Accepts]: Start accepts. Automaton has 4206 states and 18437 transitions. Word has length 10 [2022-11-26 01:08:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:17,083 INFO L495 AbstractCegarLoop]: Abstraction has 4206 states and 18437 transitions. [2022-11-26 01:08:17,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4206 states and 18437 transitions. [2022-11-26 01:08:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 01:08:17,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:17,084 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2022-11-26 01:08:17,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:17,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-26 01:08:17,285 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:17,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:17,285 INFO L85 PathProgramCache]: Analyzing trace with hash 731345482, now seen corresponding path program 1 times [2022-11-26 01:08:17,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:17,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377059046] [2022-11-26 01:08:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:17,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:18,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:18,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377059046] [2022-11-26 01:08:18,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377059046] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:18,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992626968] [2022-11-26 01:08:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:18,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:18,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:18,022 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:18,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-26 01:08:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:18,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-26 01:08:18,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:18,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:08:18,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:18,522 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-11-26 01:08:18,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-26 01:08:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:18,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:18,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:18,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-26 01:08:18,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:18,762 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-11-26 01:08:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:18,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992626968] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:18,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2091504385] [2022-11-26 01:08:18,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-11-26 01:08:18,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:18,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-26 01:08:18,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865235576] [2022-11-26 01:08:18,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:18,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-26 01:08:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:18,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-26 01:08:18,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=401, Unknown=5, NotChecked=0, Total=462 [2022-11-26 01:08:18,879 INFO L87 Difference]: Start difference. First operand 4206 states and 18437 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:22,678 INFO L93 Difference]: Finished difference Result 14247 states and 60288 transitions. [2022-11-26 01:08:22,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-26 01:08:22,679 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 01:08:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:22,754 INFO L225 Difference]: With dead ends: 14247 [2022-11-26 01:08:22,754 INFO L226 Difference]: Without dead ends: 14247 [2022-11-26 01:08:22,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=320, Invalid=1930, Unknown=6, NotChecked=0, Total=2256 [2022-11-26 01:08:22,756 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 702 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:22,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 0 Invalid, 2703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-26 01:08:22,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14247 states. [2022-11-26 01:08:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14247 to 6609. [2022-11-26 01:08:22,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6609 states, 6529 states have (on average 4.811916066778986) internal successors, (31417), 6608 states have internal predecessors, (31417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6609 states to 6609 states and 31417 transitions. [2022-11-26 01:08:23,016 INFO L78 Accepts]: Start accepts. Automaton has 6609 states and 31417 transitions. Word has length 10 [2022-11-26 01:08:23,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:23,017 INFO L495 AbstractCegarLoop]: Abstraction has 6609 states and 31417 transitions. [2022-11-26 01:08:23,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:23,017 INFO L276 IsEmpty]: Start isEmpty. Operand 6609 states and 31417 transitions. [2022-11-26 01:08:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 01:08:23,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:23,018 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:23,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-26 01:08:23,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:23,218 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:23,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash -918777105, now seen corresponding path program 1 times [2022-11-26 01:08:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:23,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793551817] [2022-11-26 01:08:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:24,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:24,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793551817] [2022-11-26 01:08:24,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793551817] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:24,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100268995] [2022-11-26 01:08:24,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:24,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:24,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:24,055 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:24,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-26 01:08:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:24,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-26 01:08:24,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:24,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:08:24,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:24,530 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-11-26 01:08:24,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:24,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-11-26 01:08:24,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:24,647 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-11-26 01:08:24,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-26 01:08:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:24,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:24,748 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1053) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 9223372039002259456))) is different from false [2022-11-26 01:08:24,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:24,908 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 32 treesize of output 33 [2022-11-26 01:08:24,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:24,922 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 311 treesize of output 301 [2022-11-26 01:08:24,933 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 143 treesize of output 127 [2022-11-26 01:08:24,942 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 270 treesize of output 238 [2022-11-26 01:08:24,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 238 treesize of output 230 [2022-11-26 01:08:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:25,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100268995] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:25,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [371239794] [2022-11-26 01:08:25,381 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:08:25,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:25,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-26 01:08:25,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564588089] [2022-11-26 01:08:25,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:25,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-26 01:08:25,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:25,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-26 01:08:25,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=361, Unknown=5, NotChecked=38, Total=462 [2022-11-26 01:08:25,384 INFO L87 Difference]: Start difference. First operand 6609 states and 31417 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:27,150 INFO L93 Difference]: Finished difference Result 9536 states and 44987 transitions. [2022-11-26 01:08:27,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 01:08:27,151 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 01:08:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:27,199 INFO L225 Difference]: With dead ends: 9536 [2022-11-26 01:08:27,199 INFO L226 Difference]: Without dead ends: 9536 [2022-11-26 01:08:27,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=154, Invalid=715, Unknown=5, NotChecked=56, Total=930 [2022-11-26 01:08:27,200 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 574 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:27,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 0 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 729 Invalid, 0 Unknown, 71 Unchecked, 1.0s Time] [2022-11-26 01:08:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9536 states. [2022-11-26 01:08:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9536 to 7130. [2022-11-26 01:08:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7130 states, 7050 states have (on average 4.841134751773049) internal successors, (34130), 7129 states have internal predecessors, (34130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7130 states to 7130 states and 34130 transitions. [2022-11-26 01:08:27,433 INFO L78 Accepts]: Start accepts. Automaton has 7130 states and 34130 transitions. Word has length 10 [2022-11-26 01:08:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:27,434 INFO L495 AbstractCegarLoop]: Abstraction has 7130 states and 34130 transitions. [2022-11-26 01:08:27,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand 7130 states and 34130 transitions. [2022-11-26 01:08:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 01:08:27,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:27,434 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:27,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:27,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-26 01:08:27,635 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash -918777104, now seen corresponding path program 1 times [2022-11-26 01:08:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:27,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814694135] [2022-11-26 01:08:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:27,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:28,247 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:28,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814694135] [2022-11-26 01:08:28,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814694135] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:28,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075208575] [2022-11-26 01:08:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:28,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:28,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:28,249 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:28,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-26 01:08:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:28,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-26 01:08:28,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:28,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:08:28,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:28,812 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-11-26 01:08:28,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:28,892 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-11-26 01:08:28,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:28,963 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-11-26 01:08:29,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:08:29,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:29,010 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 19 treesize of output 10 [2022-11-26 01:08:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:29,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:29,098 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1118) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-11-26 01:08:29,113 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1117 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1118) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-11-26 01:08:29,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:29,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-26 01:08:29,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:29,220 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 553 treesize of output 531 [2022-11-26 01:08:29,235 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 518 treesize of output 502 [2022-11-26 01:08:29,251 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 502 treesize of output 438 [2022-11-26 01:08:29,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 438 treesize of output 406 [2022-11-26 01:08:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:30,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075208575] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:30,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [316748625] [2022-11-26 01:08:30,013 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:08:30,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:30,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-26 01:08:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102842325] [2022-11-26 01:08:30,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:30,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-26 01:08:30,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:30,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-26 01:08:30,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=350, Unknown=5, NotChecked=78, Total=506 [2022-11-26 01:08:30,015 INFO L87 Difference]: Start difference. First operand 7130 states and 34130 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-11-26 01:08:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:31,037 INFO L93 Difference]: Finished difference Result 11080 states and 51166 transitions. [2022-11-26 01:08:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 01:08:31,037 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-11-26 01:08:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:31,093 INFO L225 Difference]: With dead ends: 11080 [2022-11-26 01:08:31,093 INFO L226 Difference]: Without dead ends: 11074 [2022-11-26 01:08:31,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=621, Unknown=5, NotChecked=106, Total=870 [2022-11-26 01:08:31,094 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 463 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:31,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 0 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 515 Invalid, 0 Unknown, 196 Unchecked, 0.6s Time] [2022-11-26 01:08:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2022-11-26 01:08:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 6597. [2022-11-26 01:08:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6597 states, 6517 states have (on average 4.8146386374098515) internal successors, (31377), 6596 states have internal predecessors, (31377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6597 states to 6597 states and 31377 transitions. [2022-11-26 01:08:31,331 INFO L78 Accepts]: Start accepts. Automaton has 6597 states and 31377 transitions. Word has length 10 [2022-11-26 01:08:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:31,332 INFO L495 AbstractCegarLoop]: Abstraction has 6597 states and 31377 transitions. [2022-11-26 01:08:31,332 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-11-26 01:08:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6597 states and 31377 transitions. [2022-11-26 01:08:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 01:08:31,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:31,333 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:31,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:31,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-26 01:08:31,533 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:31,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:31,534 INFO L85 PathProgramCache]: Analyzing trace with hash -918778331, now seen corresponding path program 1 times [2022-11-26 01:08:31,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:31,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984170313] [2022-11-26 01:08:31,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:31,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:32,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:32,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984170313] [2022-11-26 01:08:32,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984170313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:32,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749201278] [2022-11-26 01:08:32,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:32,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:32,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:32,115 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:32,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-26 01:08:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:32,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-26 01:08:32,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:32,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:08:32,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:32,666 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-11-26 01:08:32,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:32,733 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-11-26 01:08:32,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:32,788 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-11-26 01:08:32,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-26 01:08:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:32,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:35,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:35,172 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 32 treesize of output 33 [2022-11-26 01:08:35,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:35,188 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 311 treesize of output 301 [2022-11-26 01:08:35,197 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 286 treesize of output 270 [2022-11-26 01:08:35,205 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 270 treesize of output 238 [2022-11-26 01:08:35,218 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 123 treesize of output 115 [2022-11-26 01:08:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:35,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749201278] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:35,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1773139377] [2022-11-26 01:08:35,495 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:08:35,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:35,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-11-26 01:08:35,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005734074] [2022-11-26 01:08:35,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:35,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-26 01:08:35,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:35,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-26 01:08:35,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=379, Unknown=13, NotChecked=0, Total=462 [2022-11-26 01:08:35,497 INFO L87 Difference]: Start difference. First operand 6597 states and 31377 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:36,927 INFO L93 Difference]: Finished difference Result 10270 states and 47655 transitions. [2022-11-26 01:08:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 01:08:36,928 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 01:08:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:36,992 INFO L225 Difference]: With dead ends: 10270 [2022-11-26 01:08:36,992 INFO L226 Difference]: Without dead ends: 10270 [2022-11-26 01:08:36,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=124, Invalid=619, Unknown=13, NotChecked=0, Total=756 [2022-11-26 01:08:36,993 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 293 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:36,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 0 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 01:08:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10270 states. [2022-11-26 01:08:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10270 to 6707. [2022-11-26 01:08:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6707 states, 6627 states have (on average 4.815451939037271) internal successors, (31912), 6706 states have internal predecessors, (31912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 31912 transitions. [2022-11-26 01:08:37,333 INFO L78 Accepts]: Start accepts. Automaton has 6707 states and 31912 transitions. Word has length 10 [2022-11-26 01:08:37,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:37,333 INFO L495 AbstractCegarLoop]: Abstraction has 6707 states and 31912 transitions. [2022-11-26 01:08:37,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 6707 states and 31912 transitions. [2022-11-26 01:08:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 01:08:37,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:37,335 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:37,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-26 01:08:37,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-26 01:08:37,535 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash -918778330, now seen corresponding path program 1 times [2022-11-26 01:08:37,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:37,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47319564] [2022-11-26 01:08:37,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:37,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:38,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:38,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47319564] [2022-11-26 01:08:38,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47319564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:38,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126373210] [2022-11-26 01:08:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:38,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:38,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:38,314 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:38,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-26 01:08:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:38,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-26 01:08:38,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:38,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:08:38,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:38,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 16 treesize of output 18 [2022-11-26 01:08:38,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:38,969 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-11-26 01:08:39,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:39,058 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-11-26 01:08:39,122 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-26 01:08:39,122 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 22 treesize of output 10 [2022-11-26 01:08:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:39,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:39,251 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1248 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1248) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-11-26 01:08:41,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:41,138 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 30 treesize of output 31 [2022-11-26 01:08:41,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:41,156 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 139 treesize of output 135 [2022-11-26 01:08:41,163 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-11-26 01:08:41,170 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 98 [2022-11-26 01:08:41,182 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 46 [2022-11-26 01:08:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:41,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126373210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:41,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2032004133] [2022-11-26 01:08:41,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-11-26 01:08:41,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:41,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-11-26 01:08:41,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118268533] [2022-11-26 01:08:41,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:41,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-26 01:08:41,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:41,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-26 01:08:41,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=393, Unknown=7, NotChecked=40, Total=506 [2022-11-26 01:08:41,478 INFO L87 Difference]: Start difference. First operand 6707 states and 31912 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-11-26 01:08:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:43,057 INFO L93 Difference]: Finished difference Result 11752 states and 53577 transitions. [2022-11-26 01:08:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 01:08:43,058 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-11-26 01:08:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:43,128 INFO L225 Difference]: With dead ends: 11752 [2022-11-26 01:08:43,128 INFO L226 Difference]: Without dead ends: 11748 [2022-11-26 01:08:43,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=141, Invalid=726, Unknown=7, NotChecked=56, Total=930 [2022-11-26 01:08:43,129 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 483 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:43,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 0 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 598 Invalid, 0 Unknown, 134 Unchecked, 0.8s Time] [2022-11-26 01:08:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11748 states. [2022-11-26 01:08:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11748 to 6579. [2022-11-26 01:08:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6579 states, 6499 states have (on average 4.816433297430374) internal successors, (31302), 6578 states have internal predecessors, (31302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 31302 transitions. [2022-11-26 01:08:43,450 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 31302 transitions. Word has length 10 [2022-11-26 01:08:43,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:43,450 INFO L495 AbstractCegarLoop]: Abstraction has 6579 states and 31302 transitions. [2022-11-26 01:08:43,450 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-11-26 01:08:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 31302 transitions. [2022-11-26 01:08:43,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 01:08:43,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:43,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:43,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:43,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-26 01:08:43,652 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:43,652 INFO L85 PathProgramCache]: Analyzing trace with hash -601376565, now seen corresponding path program 1 times [2022-11-26 01:08:43,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:43,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794095789] [2022-11-26 01:08:43,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:43,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:43,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:43,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794095789] [2022-11-26 01:08:43,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794095789] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:43,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101069645] [2022-11-26 01:08:43,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:43,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:43,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:43,876 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:43,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-26 01:08:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:44,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-26 01:08:44,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:44,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:44,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101069645] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:44,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1965780169] [2022-11-26 01:08:44,372 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:08:44,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:44,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-11-26 01:08:44,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787341791] [2022-11-26 01:08:44,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:44,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 01:08:44,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 01:08:44,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-26 01:08:44,375 INFO L87 Difference]: Start difference. First operand 6579 states and 31302 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:44,666 INFO L93 Difference]: Finished difference Result 6651 states and 31454 transitions. [2022-11-26 01:08:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:08:44,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 01:08:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:44,707 INFO L225 Difference]: With dead ends: 6651 [2022-11-26 01:08:44,707 INFO L226 Difference]: Without dead ends: 6578 [2022-11-26 01:08:44,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-26 01:08:44,708 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:44,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:08:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6578 states. [2022-11-26 01:08:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6578 to 6578. [2022-11-26 01:08:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6578 states, 6498 states have (on average 4.816866728224069) internal successors, (31300), 6577 states have internal predecessors, (31300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6578 states to 6578 states and 31300 transitions. [2022-11-26 01:08:44,963 INFO L78 Accepts]: Start accepts. Automaton has 6578 states and 31300 transitions. Word has length 10 [2022-11-26 01:08:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:44,963 INFO L495 AbstractCegarLoop]: Abstraction has 6578 states and 31300 transitions. [2022-11-26 01:08:44,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 6578 states and 31300 transitions. [2022-11-26 01:08:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:08:44,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:44,964 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:44,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:45,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:45,165 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:45,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1265109570, now seen corresponding path program 1 times [2022-11-26 01:08:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:45,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758180186] [2022-11-26 01:08:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:45,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:45,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:45,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758180186] [2022-11-26 01:08:45,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758180186] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:45,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348864891] [2022-11-26 01:08:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:45,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:45,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:45,829 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:45,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-26 01:08:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:46,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-26 01:08:46,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:46,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:08:46,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:46,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-11-26 01:08:46,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:46,529 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-11-26 01:08:46,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-26 01:08:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:46,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:46,750 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1368 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1368) c_~x~0.base) (+ 8 c_~x~0.offset (* c_~i1~0 4))) 9223372039002259456))) is different from false [2022-11-26 01:08:46,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:46,870 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-11-26 01:08:46,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:46,884 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-11-26 01:08:46,894 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-11-26 01:08:46,901 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-11-26 01:08:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:47,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348864891] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:47,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [695160500] [2022-11-26 01:08:47,136 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:08:47,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:47,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-26 01:08:47,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951209946] [2022-11-26 01:08:47,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:47,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-26 01:08:47,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:47,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-26 01:08:47,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=485, Unknown=7, NotChecked=44, Total=600 [2022-11-26 01:08:47,139 INFO L87 Difference]: Start difference. First operand 6578 states and 31300 transitions. Second operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:49,238 INFO L93 Difference]: Finished difference Result 10496 states and 47928 transitions. [2022-11-26 01:08:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 01:08:49,238 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-26 01:08:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:49,301 INFO L225 Difference]: With dead ends: 10496 [2022-11-26 01:08:49,302 INFO L226 Difference]: Without dead ends: 10496 [2022-11-26 01:08:49,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=1086, Unknown=7, NotChecked=68, Total=1332 [2022-11-26 01:08:49,303 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 440 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:49,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 0 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1025 Invalid, 0 Unknown, 92 Unchecked, 1.1s Time] [2022-11-26 01:08:49,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10496 states. [2022-11-26 01:08:49,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10496 to 6647. [2022-11-26 01:08:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6647 states, 6567 states have (on average 4.820465966194609) internal successors, (31656), 6646 states have internal predecessors, (31656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6647 states to 6647 states and 31656 transitions. [2022-11-26 01:08:49,609 INFO L78 Accepts]: Start accepts. Automaton has 6647 states and 31656 transitions. Word has length 11 [2022-11-26 01:08:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:49,609 INFO L495 AbstractCegarLoop]: Abstraction has 6647 states and 31656 transitions. [2022-11-26 01:08:49,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 6647 states and 31656 transitions. [2022-11-26 01:08:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:08:49,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:49,611 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:49,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:49,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-26 01:08:49,813 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:49,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1265109571, now seen corresponding path program 1 times [2022-11-26 01:08:49,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:49,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777756743] [2022-11-26 01:08:49,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:49,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:50,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:50,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777756743] [2022-11-26 01:08:50,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777756743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:50,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923349603] [2022-11-26 01:08:50,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:50,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:50,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:50,659 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:50,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-26 01:08:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:51,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-26 01:08:51,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:51,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:08:51,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:51,238 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-11-26 01:08:51,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:51,317 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-11-26 01:08:51,419 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-26 01:08:51,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 22 treesize of output 10 [2022-11-26 01:08:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:51,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:51,564 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1432 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1432) c_~x~0.base) (+ 8 c_~x~0.offset (* c_~i1~0 4))) 4294967296)) is different from false [2022-11-26 01:08:51,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:51,667 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-11-26 01:08:51,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:51,679 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-11-26 01:08:51,689 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-11-26 01:08:51,695 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-11-26 01:08:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:51,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923349603] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:51,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1793246574] [2022-11-26 01:08:51,907 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:08:51,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:51,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-26 01:08:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734593838] [2022-11-26 01:08:51,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:51,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-26 01:08:51,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:51,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-26 01:08:51,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=4, NotChecked=46, Total=650 [2022-11-26 01:08:51,910 INFO L87 Difference]: Start difference. First operand 6647 states and 31656 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-11-26 01:08:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:08:57,536 INFO L93 Difference]: Finished difference Result 21239 states and 94253 transitions. [2022-11-26 01:08:57,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-26 01:08:57,536 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-11-26 01:08:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:08:57,649 INFO L225 Difference]: With dead ends: 21239 [2022-11-26 01:08:57,649 INFO L226 Difference]: Without dead ends: 21239 [2022-11-26 01:08:57,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=576, Invalid=3330, Unknown=4, NotChecked=122, Total=4032 [2022-11-26 01:08:57,651 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 916 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:08:57,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 0 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2356 Invalid, 0 Unknown, 281 Unchecked, 2.6s Time] [2022-11-26 01:08:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21239 states. [2022-11-26 01:08:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21239 to 7404. [2022-11-26 01:08:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7404 states, 7324 states have (on average 4.878618241398143) internal successors, (35731), 7403 states have internal predecessors, (35731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:08:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7404 states to 7404 states and 35731 transitions. [2022-11-26 01:08:58,001 INFO L78 Accepts]: Start accepts. Automaton has 7404 states and 35731 transitions. Word has length 11 [2022-11-26 01:08:58,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:08:58,001 INFO L495 AbstractCegarLoop]: Abstraction has 7404 states and 35731 transitions. [2022-11-26 01:08:58,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-11-26 01:08:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 7404 states and 35731 transitions. [2022-11-26 01:08:58,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:08:58,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:08:58,002 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:08:58,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-26 01:08:58,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-26 01:08:58,203 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:08:58,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:08:58,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1265073317, now seen corresponding path program 1 times [2022-11-26 01:08:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:08:58,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287177969] [2022-11-26 01:08:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:58,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:08:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:58,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:08:58,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287177969] [2022-11-26 01:08:58,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287177969] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:08:58,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579653063] [2022-11-26 01:08:58,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:08:58,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:08:58,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:08:58,690 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:08:58,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-26 01:08:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:08:58,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-26 01:08:58,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:08:59,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:08:59,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:59,175 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-11-26 01:08:59,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:08:59,240 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-11-26 01:08:59,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-26 01:08:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:59,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:59,456 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1496 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1496) c_~x~0.base) (+ 8 c_~x~0.offset (* c_~i1~0 4))) 9223372039002259456))) is different from false [2022-11-26 01:08:59,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:59,568 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-11-26 01:08:59,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:08:59,580 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-11-26 01:08:59,586 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-11-26 01:08:59,594 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-11-26 01:08:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:59,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579653063] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:08:59,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [559324927] [2022-11-26 01:08:59,817 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:08:59,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:08:59,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-26 01:08:59,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750916800] [2022-11-26 01:08:59,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:08:59,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-26 01:08:59,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:08:59,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-26 01:08:59,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=4, NotChecked=44, Total=600 [2022-11-26 01:08:59,820 INFO L87 Difference]: Start difference. First operand 7404 states and 35731 transitions. Second operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:09:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:01,613 INFO L93 Difference]: Finished difference Result 11026 states and 52763 transitions. [2022-11-26 01:09:01,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 01:09:01,614 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-26 01:09:01,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:01,683 INFO L225 Difference]: With dead ends: 11026 [2022-11-26 01:09:01,684 INFO L226 Difference]: Without dead ends: 11026 [2022-11-26 01:09:01,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=4, NotChecked=68, Total=1332 [2022-11-26 01:09:01,685 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 448 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:01,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 0 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 680 Invalid, 0 Unknown, 99 Unchecked, 0.8s Time] [2022-11-26 01:09:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11026 states. [2022-11-26 01:09:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11026 to 8253. [2022-11-26 01:09:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8253 states, 8173 states have (on average 4.992536400342591) internal successors, (40804), 8252 states have internal predecessors, (40804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:09:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8253 states to 8253 states and 40804 transitions. [2022-11-26 01:09:02,041 INFO L78 Accepts]: Start accepts. Automaton has 8253 states and 40804 transitions. Word has length 11 [2022-11-26 01:09:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:02,041 INFO L495 AbstractCegarLoop]: Abstraction has 8253 states and 40804 transitions. [2022-11-26 01:09:02,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:09:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8253 states and 40804 transitions. [2022-11-26 01:09:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:09:02,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:02,043 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:09:02,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-26 01:09:02,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:02,243 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:09:02,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:02,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1265073318, now seen corresponding path program 1 times [2022-11-26 01:09:02,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:02,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863386109] [2022-11-26 01:09:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:09:02,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:02,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863386109] [2022-11-26 01:09:02,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863386109] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:09:02,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79692620] [2022-11-26 01:09:02,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:02,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:02,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:09:02,903 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:09:02,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-26 01:09:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:03,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-26 01:09:03,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:09:03,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 01:09:03,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:03,461 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-11-26 01:09:03,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:09:03,527 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-11-26 01:09:03,629 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-11-26 01:09:03,629 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 22 treesize of output 10 [2022-11-26 01:09:03,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:09:03,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:09:03,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:09:03,951 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-11-26 01:09:03,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:09:03,964 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-11-26 01:09:03,974 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-11-26 01:09:03,982 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-11-26 01:09:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:09:04,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79692620] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:09:04,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [232894718] [2022-11-26 01:09:04,178 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 01:09:04,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:09:04,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-26 01:09:04,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083651297] [2022-11-26 01:09:04,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:09:04,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-26 01:09:04,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:09:04,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-26 01:09:04,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=571, Unknown=8, NotChecked=0, Total=650 [2022-11-26 01:09:04,181 INFO L87 Difference]: Start difference. First operand 8253 states and 40804 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-11-26 01:09:06,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:09:06,396 INFO L93 Difference]: Finished difference Result 12032 states and 55945 transitions. [2022-11-26 01:09:06,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 01:09:06,396 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-11-26 01:09:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:09:06,466 INFO L225 Difference]: With dead ends: 12032 [2022-11-26 01:09:06,466 INFO L226 Difference]: Without dead ends: 12032 [2022-11-26 01:09:06,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=205, Invalid=1347, Unknown=8, NotChecked=0, Total=1560 [2022-11-26 01:09:06,467 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 533 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:09:06,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 0 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 01:09:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12032 states. [2022-11-26 01:09:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12032 to 7407. [2022-11-26 01:09:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7407 states, 7327 states have (on average 4.877439606933261) internal successors, (35737), 7406 states have internal predecessors, (35737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:09:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7407 states to 7407 states and 35737 transitions. [2022-11-26 01:09:06,788 INFO L78 Accepts]: Start accepts. Automaton has 7407 states and 35737 transitions. Word has length 11 [2022-11-26 01:09:06,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:09:06,788 INFO L495 AbstractCegarLoop]: Abstraction has 7407 states and 35737 transitions. [2022-11-26 01:09:06,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 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-11-26 01:09:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 7407 states and 35737 transitions. [2022-11-26 01:09:06,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:09:06,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:09:06,789 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:09:06,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-26 01:09:06,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-26 01:09:06,992 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-11-26 01:09:06,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:09:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1204386167, now seen corresponding path program 2 times [2022-11-26 01:09:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:09:06,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150717898] [2022-11-26 01:09:06,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:09:06,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:09:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:09:07,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:09:07,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:09:07,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150717898] [2022-11-26 01:09:07,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150717898] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:09:07,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060259209] [2022-11-26 01:09:07,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:09:07,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:09:07,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:09:07,751 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:09:07,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_81c3bada-8245-4422-b454-205b8c9512f4/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process