./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 16:08:18,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 16:08:18,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 16:08:19,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 16:08:19,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 16:08:19,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 16:08:19,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 16:08:19,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 16:08:19,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 16:08:19,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 16:08:19,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 16:08:19,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 16:08:19,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 16:08:19,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 16:08:19,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 16:08:19,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 16:08:19,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 16:08:19,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 16:08:19,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 16:08:19,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 16:08:19,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 16:08:19,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 16:08:19,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 16:08:19,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 16:08:19,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 16:08:19,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 16:08:19,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 16:08:19,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 16:08:19,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 16:08:19,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 16:08:19,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 16:08:19,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 16:08:19,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 16:08:19,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 16:08:19,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 16:08:19,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 16:08:19,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 16:08:19,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 16:08:19,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 16:08:19,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 16:08:19,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 16:08:19,125 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 16:08:19,172 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 16:08:19,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 16:08:19,173 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 16:08:19,173 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 16:08:19,174 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 16:08:19,175 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 16:08:19,175 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 16:08:19,175 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 16:08:19,175 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 16:08:19,176 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 16:08:19,177 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 16:08:19,177 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 16:08:19,177 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 16:08:19,178 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 16:08:19,178 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 16:08:19,178 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 16:08:19,178 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 16:08:19,179 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 16:08:19,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 16:08:19,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 16:08:19,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 16:08:19,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 16:08:19,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 16:08:19,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 16:08:19,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 16:08:19,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 16:08:19,182 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 16:08:19,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 16:08:19,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 16:08:19,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 16:08:19,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 16:08:19,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 16:08:19,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:08:19,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 16:08:19,184 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 16:08:19,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 16:08:19,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 16:08:19,185 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 16:08:19,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 16:08:19,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 16:08:19,185 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 16:08:19,185 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_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 [2022-11-23 16:08:19,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 16:08:19,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 16:08:19,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 16:08:19,563 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 16:08:19,564 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 16:08:19,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-11-23 16:08:22,678 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 16:08:22,899 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 16:08:22,905 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-11-23 16:08:22,914 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/data/ed5bad882/32e1ba4c0f4343c9b097499fd3e78af6/FLAG748bee853 [2022-11-23 16:08:22,939 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/data/ed5bad882/32e1ba4c0f4343c9b097499fd3e78af6 [2022-11-23 16:08:22,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 16:08:22,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 16:08:22,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 16:08:22,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 16:08:22,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 16:08:22,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:08:22" (1/1) ... [2022-11-23 16:08:22,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566260be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:22, skipping insertion in model container [2022-11-23 16:08:22,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:08:22" (1/1) ... [2022-11-23 16:08:22,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 16:08:22,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 16:08:23,170 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_9fef534e-4450-433b-9fc0-0fc270b2dcf9/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-23 16:08:23,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:08:23,193 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 16:08:23,220 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_9fef534e-4450-433b-9fc0-0fc270b2dcf9/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-23 16:08:23,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:08:23,249 INFO L208 MainTranslator]: Completed translation [2022-11-23 16:08:23,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23 WrapperNode [2022-11-23 16:08:23,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 16:08:23,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 16:08:23,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 16:08:23,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 16:08:23,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23" (1/1) ... [2022-11-23 16:08:23,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23" (1/1) ... [2022-11-23 16:08:23,312 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 277 [2022-11-23 16:08:23,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 16:08:23,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 16:08:23,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 16:08:23,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 16:08:23,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23" (1/1) ... [2022-11-23 16:08:23,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23" (1/1) ... [2022-11-23 16:08:23,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23" (1/1) ... [2022-11-23 16:08:23,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23" (1/1) ... [2022-11-23 16:08:23,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23" (1/1) ... [2022-11-23 16:08:23,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23" (1/1) ... [2022-11-23 16:08:23,378 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23" (1/1) ... [2022-11-23 16:08:23,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23" (1/1) ... [2022-11-23 16:08:23,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 16:08:23,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 16:08:23,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 16:08:23,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 16:08:23,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23" (1/1) ... [2022-11-23 16:08:23,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:08:23,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:23,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 16:08:23,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 16:08:23,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 16:08:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-23 16:08:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-23 16:08:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-23 16:08:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-23 16:08:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 16:08:23,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 16:08:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 16:08:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 16:08:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 16:08:23,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 16:08:23,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 16:08:23,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 16:08:23,476 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 16:08:23,674 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 16:08:23,677 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 16:08:24,377 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 16:08:24,393 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 16:08:24,394 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-23 16:08:24,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:08:24 BoogieIcfgContainer [2022-11-23 16:08:24,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 16:08:24,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 16:08:24,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 16:08:24,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 16:08:24,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:08:22" (1/3) ... [2022-11-23 16:08:24,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a437d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:08:24, skipping insertion in model container [2022-11-23 16:08:24,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:23" (2/3) ... [2022-11-23 16:08:24,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a437d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:08:24, skipping insertion in model container [2022-11-23 16:08:24,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:08:24" (3/3) ... [2022-11-23 16:08:24,413 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-11-23 16:08:24,422 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 16:08:24,434 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 16:08:24,434 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 16:08:24,434 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 16:08:24,563 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 16:08:24,608 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 16:08:24,625 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 375 places, 396 transitions, 808 flow [2022-11-23 16:08:24,628 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 375 places, 396 transitions, 808 flow [2022-11-23 16:08:24,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 396 transitions, 808 flow [2022-11-23 16:08:24,901 INFO L130 PetriNetUnfolder]: 28/394 cut-off events. [2022-11-23 16:08:24,907 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 16:08:24,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 394 events. 28/394 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 923 event pairs, 0 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 271. Up to 2 conditions per place. [2022-11-23 16:08:24,945 INFO L119 LiptonReduction]: Number of co-enabled transitions 37700 [2022-11-23 16:08:40,726 INFO L134 LiptonReduction]: Checked pairs total: 31579 [2022-11-23 16:08:40,727 INFO L136 LiptonReduction]: Total number of compositions: 485 [2022-11-23 16:08:40,740 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 58 flow [2022-11-23 16:08:40,773 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:40,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 16:08:40,818 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;@589b1ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 16:08:40,819 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-23 16:08:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 16:08:40,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:40,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:40,830 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:08:40,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1578748008, now seen corresponding path program 1 times [2022-11-23 16:08:40,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:40,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310310581] [2022-11-23 16:08:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:40,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:41,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:41,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310310581] [2022-11-23 16:08:41,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310310581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:41,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:41,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 16:08:41,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138137090] [2022-11-23 16:08:41,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:41,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:08:41,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:41,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:08:41,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:08:41,853 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 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 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:42,063 INFO L93 Difference]: Finished difference Result 90 states and 237 transitions. [2022-11-23 16:08:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:08:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 16:08:42,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:42,079 INFO L225 Difference]: With dead ends: 90 [2022-11-23 16:08:42,079 INFO L226 Difference]: Without dead ends: 85 [2022-11-23 16:08:42,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 16:08:42,084 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:42,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-23 16:08:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 45. [2022-11-23 16:08:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.477272727272727) internal successors, (109), 44 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 109 transitions. [2022-11-23 16:08:42,136 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 109 transitions. Word has length 12 [2022-11-23 16:08:42,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:42,138 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 109 transitions. [2022-11-23 16:08:42,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:42,139 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 109 transitions. [2022-11-23 16:08:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 16:08:42,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:42,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:42,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 16:08:42,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:08:42,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:42,142 INFO L85 PathProgramCache]: Analyzing trace with hash -588606708, now seen corresponding path program 1 times [2022-11-23 16:08:42,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:42,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009913046] [2022-11-23 16:08:42,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:42,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:42,425 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-23 16:08:42,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:42,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009913046] [2022-11-23 16:08:42,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009913046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:42,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:42,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:08:42,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036072099] [2022-11-23 16:08:42,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:42,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:08:42,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:42,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:08:42,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:08:42,430 INFO L87 Difference]: Start difference. First operand 45 states and 109 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:42,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:42,543 INFO L93 Difference]: Finished difference Result 89 states and 201 transitions. [2022-11-23 16:08:42,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:08:42,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 16:08:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:42,546 INFO L225 Difference]: With dead ends: 89 [2022-11-23 16:08:42,546 INFO L226 Difference]: Without dead ends: 83 [2022-11-23 16:08:42,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:08:42,548 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:42,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:42,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-23 16:08:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2022-11-23 16:08:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 2.485294117647059) internal successors, (169), 68 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 169 transitions. [2022-11-23 16:08:42,560 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 169 transitions. Word has length 13 [2022-11-23 16:08:42,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:42,561 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 169 transitions. [2022-11-23 16:08:42,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 169 transitions. [2022-11-23 16:08:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 16:08:42,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:42,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:42,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 16:08:42,564 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:08:42,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash -85527686, now seen corresponding path program 1 times [2022-11-23 16:08:42,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:42,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926142416] [2022-11-23 16:08:42,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:42,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:42,831 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-23 16:08:42,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:42,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926142416] [2022-11-23 16:08:42,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926142416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:42,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:42,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 16:08:42,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863463593] [2022-11-23 16:08:42,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:42,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 16:08:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:42,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 16:08:42,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 16:08:42,838 INFO L87 Difference]: Start difference. First operand 69 states and 169 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:42,969 INFO L93 Difference]: Finished difference Result 53 states and 118 transitions. [2022-11-23 16:08:42,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:08:42,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 16:08:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:42,971 INFO L225 Difference]: With dead ends: 53 [2022-11-23 16:08:42,972 INFO L226 Difference]: Without dead ends: 46 [2022-11-23 16:08:42,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:08:42,975 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:42,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-23 16:08:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-23 16:08:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.4444444444444446) internal successors, (110), 45 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 110 transitions. [2022-11-23 16:08:42,991 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 110 transitions. Word has length 14 [2022-11-23 16:08:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:42,992 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 110 transitions. [2022-11-23 16:08:42,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 110 transitions. [2022-11-23 16:08:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 16:08:42,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:42,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:42,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 16:08:42,995 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:08:42,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:42,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1631965637, now seen corresponding path program 1 times [2022-11-23 16:08:42,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:42,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242002391] [2022-11-23 16:08:42,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:42,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:08:43,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:43,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242002391] [2022-11-23 16:08:43,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242002391] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:43,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004715726] [2022-11-23 16:08:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:43,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:43,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:43,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:43,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 16:08:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:43,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 16:08:43,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:08:43,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:08:43,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004715726] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:43,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 16:08:43,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-11-23 16:08:43,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713928401] [2022-11-23 16:08:43,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:43,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:08:43,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:43,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:08:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-23 16:08:43,686 INFO L87 Difference]: Start difference. First operand 46 states and 110 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:43,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:43,763 INFO L93 Difference]: Finished difference Result 44 states and 111 transitions. [2022-11-23 16:08:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:08:43,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 16:08:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:43,765 INFO L225 Difference]: With dead ends: 44 [2022-11-23 16:08:43,765 INFO L226 Difference]: Without dead ends: 44 [2022-11-23 16:08:43,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-23 16:08:43,766 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:43,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-23 16:08:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2022-11-23 16:08:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 39 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2022-11-23 16:08:43,772 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 97 transitions. Word has length 14 [2022-11-23 16:08:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:43,772 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 97 transitions. [2022-11-23 16:08:43,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 97 transitions. [2022-11-23 16:08:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 16:08:43,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:43,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:43,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:43,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:43,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:08:43,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:43,982 INFO L85 PathProgramCache]: Analyzing trace with hash 32738273, now seen corresponding path program 1 times [2022-11-23 16:08:43,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:43,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105840487] [2022-11-23 16:08:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:43,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:44,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:44,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105840487] [2022-11-23 16:08:44,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105840487] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:44,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613481161] [2022-11-23 16:08:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:44,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:44,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:44,356 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:44,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 16:08:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:44,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 16:08:44,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:08:44,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:08:44,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613481161] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:44,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 16:08:44,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2022-11-23 16:08:44,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116247786] [2022-11-23 16:08:44,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:44,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:08:44,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:44,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:08:44,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-23 16:08:44,765 INFO L87 Difference]: Start difference. First operand 40 states and 97 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:44,863 INFO L93 Difference]: Finished difference Result 52 states and 130 transitions. [2022-11-23 16:08:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:08:44,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 16:08:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:44,867 INFO L225 Difference]: With dead ends: 52 [2022-11-23 16:08:44,867 INFO L226 Difference]: Without dead ends: 52 [2022-11-23 16:08:44,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-23 16:08:44,870 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:44,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-23 16:08:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-23 16:08:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 51 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 130 transitions. [2022-11-23 16:08:44,891 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 130 transitions. Word has length 15 [2022-11-23 16:08:44,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:44,892 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 130 transitions. [2022-11-23 16:08:44,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 130 transitions. [2022-11-23 16:08:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:08:44,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:44,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:44,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:45,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:45,108 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:08:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1270268237, now seen corresponding path program 1 times [2022-11-23 16:08:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:45,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806324884] [2022-11-23 16:08:45,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:45,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:08:47,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:47,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806324884] [2022-11-23 16:08:47,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806324884] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:47,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736197686] [2022-11-23 16:08:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:47,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:47,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:47,097 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:47,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 16:08:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:47,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-23 16:08:47,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:47,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:47,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:47,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:47,711 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 22 treesize of output 24 [2022-11-23 16:08:47,892 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 193 treesize of output 157 [2022-11-23 16:08:48,007 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-23 16:08:48,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:48,624 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse1))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= c_~sum1~0 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse1))) (or (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (<= (+ c_~bag2~0 .cse2 c_~sum2~0) c_~sum1~0)))))) is different from false [2022-11-23 16:08:48,671 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0))))))) is different from false [2022-11-23 16:08:48,724 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1)))))) is different from false [2022-11-23 16:08:48,767 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_133 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-11-23 16:08:48,855 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse0 2147483648))) (not (<= .cse0 2147483647)) (<= .cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse2 2147483648))) (<= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse2) (not (<= .cse2 2147483647))))))) is different from false [2022-11-23 16:08:48,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:08:48,885 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 99 treesize of output 63 [2022-11-23 16:08:48,893 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 506 treesize of output 458 [2022-11-23 16:08:48,915 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 317 treesize of output 291 [2022-11-23 16:08:48,923 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 279 treesize of output 267 [2022-11-23 16:08:49,100 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 16:08:49,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-11-23 16:08:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-23 16:08:49,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736197686] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:08:49,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [85032999] [2022-11-23 16:08:49,137 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) 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-23 16:08:49,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:08:49,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-11-23 16:08:49,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948306121] [2022-11-23 16:08:49,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:08:49,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 16:08:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:49,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 16:08:49,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=365, Unknown=5, NotChecked=210, Total=650 [2022-11-23 16:08:49,144 INFO L87 Difference]: Start difference. First operand 52 states and 130 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:50,468 INFO L93 Difference]: Finished difference Result 107 states and 276 transitions. [2022-11-23 16:08:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 16:08:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:08:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:50,470 INFO L225 Difference]: With dead ends: 107 [2022-11-23 16:08:50,470 INFO L226 Difference]: Without dead ends: 102 [2022-11-23 16:08:50,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=169, Invalid=716, Unknown=5, NotChecked=300, Total=1190 [2022-11-23 16:08:50,472 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 192 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:50,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 0 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 345 Invalid, 0 Unknown, 171 Unchecked, 0.4s Time] [2022-11-23 16:08:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-23 16:08:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2022-11-23 16:08:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.5217391304347827) internal successors, (174), 69 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 174 transitions. [2022-11-23 16:08:50,479 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 174 transitions. Word has length 16 [2022-11-23 16:08:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:50,480 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 174 transitions. [2022-11-23 16:08:50,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 174 transitions. [2022-11-23 16:08:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:08:50,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:50,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:50,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:50,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:50,682 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:08:50,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:50,683 INFO L85 PathProgramCache]: Analyzing trace with hash 696942173, now seen corresponding path program 2 times [2022-11-23 16:08:50,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:50,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321464994] [2022-11-23 16:08:50,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:52,427 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-23 16:08:52,427 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:52,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321464994] [2022-11-23 16:08:52,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321464994] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:52,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949282307] [2022-11-23 16:08:52,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:08:52,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:52,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:52,430 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:52,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 16:08:52,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 16:08:52,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:08:52,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-23 16:08:52,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:52,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:52,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:52,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:52,945 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-23 16:08:53,171 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 193 treesize of output 157 [2022-11-23 16:08:53,323 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-23 16:08:53,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:53,742 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-11-23 16:08:53,778 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-11-23 16:08:53,816 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse0) 2147483647))))) (forall ((v_ArrVal_167 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) c_~A~0.base) .cse2))) (or (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))) (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse3) 2147483647))))))) is different from false [2022-11-23 16:08:53,887 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_166 (Array Int Int)) (v_ArrVal_167 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_166))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse0 2147483648))) (<= .cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (<= .cse0 2147483647)))))) (forall ((v_ArrVal_166 (Array Int Int)) (v_ArrVal_167 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_166))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_167) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= 0 (+ .cse2 2147483648))) (<= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse2) (not (<= .cse2 2147483647))))))) is different from false [2022-11-23 16:08:53,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:08:53,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 63 [2022-11-23 16:08:53,918 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 506 treesize of output 458 [2022-11-23 16:08:53,938 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 320 treesize of output 306 [2022-11-23 16:08:53,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 306 treesize of output 280 [2022-11-23 16:08:54,068 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 16:08:54,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 1 [2022-11-23 16:08:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-23 16:08:54,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949282307] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:08:54,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1240588751] [2022-11-23 16:08:54,089 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:336) 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-23 16:08:54,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:08:54,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-11-23 16:08:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156064923] [2022-11-23 16:08:54,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:08:54,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 16:08:54,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:54,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 16:08:54,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=393, Unknown=4, NotChecked=172, Total=650 [2022-11-23 16:08:54,093 INFO L87 Difference]: Start difference. First operand 70 states and 174 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:56,044 INFO L93 Difference]: Finished difference Result 236 states and 632 transitions. [2022-11-23 16:08:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 16:08:56,045 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:08:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:56,047 INFO L225 Difference]: With dead ends: 236 [2022-11-23 16:08:56,048 INFO L226 Difference]: Without dead ends: 226 [2022-11-23 16:08:56,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=284, Invalid=1134, Unknown=4, NotChecked=300, Total=1722 [2022-11-23 16:08:56,049 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:56,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 0 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 342 Invalid, 0 Unknown, 312 Unchecked, 0.5s Time] [2022-11-23 16:08:56,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-23 16:08:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 72. [2022-11-23 16:08:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.6056338028169015) internal successors, (185), 71 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 185 transitions. [2022-11-23 16:08:56,071 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 185 transitions. Word has length 16 [2022-11-23 16:08:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:56,072 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 185 transitions. [2022-11-23 16:08:56,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 185 transitions. [2022-11-23 16:08:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:08:56,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:56,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:56,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:56,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:56,283 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:08:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash 724647803, now seen corresponding path program 3 times [2022-11-23 16:08:56,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:56,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298776373] [2022-11-23 16:08:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:56,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:58,089 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-23 16:08:58,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298776373] [2022-11-23 16:08:58,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298776373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:58,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070579836] [2022-11-23 16:08:58,090 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:08:58,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:58,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:58,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:58,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 16:08:58,239 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:08:58,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:08:58,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-23 16:08:58,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:58,297 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-23 16:08:58,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:58,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:58,707 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-23 16:08:58,965 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 187 treesize of output 151 [2022-11-23 16:08:59,152 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-23 16:08:59,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:59,725 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~j~0 c_~N~0)) (<= (+ c_~i~0 1) c_~N~0) (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))))))))) is different from false [2022-11-23 16:08:59,927 WARN L837 $PredicateComparison]: unable to prove that (or (not (< c_~i~0 c_~N~0)) (not (< c_~j~0 c_~N~0)) (< (+ c_~i~0 1) c_~N~0) (let ((.cse1 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse1) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (<= .cse1 (+ c_~bag2~0 .cse3 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))))))))) is different from false [2022-11-23 16:09:00,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:09:00,173 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 99 treesize of output 63 [2022-11-23 16:09:00,180 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 238 treesize of output 214 [2022-11-23 16:09:00,191 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 206 treesize of output 190 [2022-11-23 16:09:00,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 178 [2022-11-23 16:09:00,437 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 16:09:00,438 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 99 treesize of output 1 [2022-11-23 16:09:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 16:09:00,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070579836] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:09:00,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1329280865] [2022-11-23 16:09:00,514 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:336) 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-23 16:09:00,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:09:00,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-11-23 16:09:00,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722199883] [2022-11-23 16:09:00,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:09:00,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-23 16:09:00,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:09:00,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-23 16:09:00,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=460, Unknown=11, NotChecked=90, Total=650 [2022-11-23 16:09:00,518 INFO L87 Difference]: Start difference. First operand 72 states and 185 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:09:05,621 WARN L837 $PredicateComparison]: unable to prove that (and (or (not (< c_~j~0 c_~N~0)) (<= (+ c_~i~0 1) c_~N~0) (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse2 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (<= .cse1 (+ c_~bag2~0 .cse0 c_~sum2~0)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648)))))) (forall ((v_ArrVal_201 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_201) c_~A~0.base) .cse2))) (or (<= (+ c_~bag2~0 .cse3 c_~sum2~0) .cse1) (not (<= (+ c_~bag2~0 .cse3) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse3 2147483648))))))))) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) is different from false [2022-11-23 16:09:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:09:07,245 INFO L93 Difference]: Finished difference Result 392 states and 1067 transitions. [2022-11-23 16:09:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-23 16:09:07,246 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:09:07,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:09:07,250 INFO L225 Difference]: With dead ends: 392 [2022-11-23 16:09:07,250 INFO L226 Difference]: Without dead ends: 382 [2022-11-23 16:09:07,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=832, Invalid=3445, Unknown=25, NotChecked=390, Total=4692 [2022-11-23 16:09:07,253 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 501 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 86 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-23 16:09:07,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 0 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 674 Invalid, 23 Unknown, 216 Unchecked, 1.3s Time] [2022-11-23 16:09:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-23 16:09:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 94. [2022-11-23 16:09:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.774193548387097) internal successors, (258), 93 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:09:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 258 transitions. [2022-11-23 16:09:07,267 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 258 transitions. Word has length 16 [2022-11-23 16:09:07,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:09:07,268 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 258 transitions. [2022-11-23 16:09:07,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:09:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 258 transitions. [2022-11-23 16:09:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:09:07,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:09:07,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:09:07,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 16:09:07,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:09:07,475 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:09:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:09:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash -169295787, now seen corresponding path program 4 times [2022-11-23 16:09:07,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:09:07,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510237528] [2022-11-23 16:09:07,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:09:07,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:09:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:09:09,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-23 16:09:09,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:09:09,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510237528] [2022-11-23 16:09:09,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510237528] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:09:09,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807406803] [2022-11-23 16:09:09,013 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 16:09:09,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:09:09,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:09:09,015 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:09:09,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 16:09:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:09:09,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-23 16:09:09,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:09:09,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:09:09,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:09:09,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:09:09,752 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 31 treesize of output 15 [2022-11-23 16:09:09,942 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-23 16:09:09,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:09:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:09:10,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807406803] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:09:10,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1373421409] [2022-11-23 16:09:10,886 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:336) 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-23 16:09:10,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:09:10,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2022-11-23 16:09:10,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108303928] [2022-11-23 16:09:10,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:09:10,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 16:09:10,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:09:10,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 16:09:10,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=468, Unknown=6, NotChecked=0, Total=552 [2022-11-23 16:09:10,890 INFO L87 Difference]: Start difference. First operand 94 states and 258 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:09:17,277 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~i~0 1))) (let ((.cse3 (not (< c_~j~0 c_~N~0))) (.cse4 (< .cse2 c_~N~0)) (.cse7 (+ c_~A~0.offset (* c_~i~0 4))) (.cse8 (+ c_~A~0.offset (* c_~j~0 4))) (.cse11 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (= c_~sum1~0 0) (or (let ((.cse1 (+ c_~bag1~0 c_~sum1~0)) (.cse0 (+ c_~bag2~0 c_~sum2~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (<= .cse2 c_~N~0)) (<= 0 (+ c_~bag1~0 2147483648)) (or .cse3 .cse4 (and (forall ((v_ArrVal_235 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_235) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse8))) (or (not (<= (+ .cse5 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse5 c_~bag2~0 2147483648))) (<= (+ .cse5 c_~bag2~0 c_~sum2~0) (+ (select .cse6 .cse7) |c_thread1Thread1of1ForFork0_plus_#in~b#1| |c_thread1Thread1of1ForFork0_plus_#in~a#1|)))))) (forall ((v_ArrVal_235 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_235) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse8))) (or (not (<= (+ .cse9 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse9 c_~bag2~0 2147483648))) (<= (+ (select .cse10 .cse7) |c_thread1Thread1of1ForFork0_plus_#in~b#1| |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse9 c_~bag2~0 c_~sum2~0)))))))) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 c_~N~0) (<= .cse11 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~sum2~0 2147483647) (or .cse3 .cse4 (and (forall ((v_ArrVal_235 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_235) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse8))) (or (not (<= (+ .cse12 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse12 c_~bag2~0 2147483648))) (<= (+ .cse12 c_~bag2~0 c_~sum2~0) (+ (select .cse13 .cse7) c_~bag1~0 c_~sum1~0)))))) (forall ((v_ArrVal_235 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_235) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse8))) (or (not (<= (+ .cse14 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse14 c_~bag2~0 2147483648))) (<= (+ (select .cse15 .cse7) c_~bag1~0 c_~sum1~0) (+ .cse14 c_~bag2~0 c_~sum2~0)))))))) (= c_~sum1~0 c_~sum2~0) (<= c_~bag1~0 2147483647) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 c_~N~0) (<= 0 (+ c_~sum2~0 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~bag1~0 c_~sum2~0) (<= c_~i~0 1)))) is different from false [2022-11-23 16:09:27,599 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 100 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:09:32,576 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or (not (< c_~j~0 c_~N~0)) (< (+ c_~i~0 1) c_~N~0) (let ((.cse2 (+ c_~A~0.offset (* c_~i~0 4))) (.cse3 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_235 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_235) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse3))) (or (not (<= (+ .cse0 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse0 c_~bag2~0 2147483648))) (<= (+ .cse0 c_~bag2~0 c_~sum2~0) (+ (select .cse1 .cse2) |c_thread1Thread1of1ForFork0_plus_#in~b#1| |c_thread1Thread1of1ForFork0_plus_#in~a#1|)))))) (forall ((v_ArrVal_235 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_235) c_~A~0.base))) (let ((.cse4 (select .cse5 .cse3))) (or (not (<= (+ .cse4 c_~bag2~0) 2147483647)) (not (<= 0 (+ .cse4 c_~bag2~0 2147483648))) (<= (+ (select .cse5 .cse2) |c_thread1Thread1of1ForFork0_plus_#in~b#1| |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse4 c_~bag2~0 c_~sum2~0))))))))) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 c_~N~0) (<= .cse6 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~sum2~0 2147483647) (= c_~sum1~0 c_~sum2~0) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 (+ c_~sum2~0 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base|))) is different from false [2022-11-23 16:09:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:09:37,727 INFO L93 Difference]: Finished difference Result 408 states and 1054 transitions. [2022-11-23 16:09:37,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-23 16:09:37,727 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:09:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:09:37,730 INFO L225 Difference]: With dead ends: 408 [2022-11-23 16:09:37,731 INFO L226 Difference]: Without dead ends: 399 [2022-11-23 16:09:37,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=1276, Invalid=6124, Unknown=90, NotChecked=342, Total=7832 [2022-11-23 16:09:37,734 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 430 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 101 mSolverCounterUnsat, 59 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 59 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-23 16:09:37,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 0 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 822 Invalid, 59 Unknown, 6 Unchecked, 2.0s Time] [2022-11-23 16:09:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-11-23 16:09:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 104. [2022-11-23 16:09:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.9223300970873787) internal successors, (301), 103 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:09:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 301 transitions. [2022-11-23 16:09:37,746 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 301 transitions. Word has length 16 [2022-11-23 16:09:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:09:37,746 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 301 transitions. [2022-11-23 16:09:37,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:09:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 301 transitions. [2022-11-23 16:09:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:09:37,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:09:37,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:09:37,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 16:09:37,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-23 16:09:37,954 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:09:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:09:37,954 INFO L85 PathProgramCache]: Analyzing trace with hash -141590157, now seen corresponding path program 5 times [2022-11-23 16:09:37,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:09:37,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722520282] [2022-11-23 16:09:37,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:09:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:09:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:09:39,599 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-23 16:09:39,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:09:39,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722520282] [2022-11-23 16:09:39,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722520282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:09:39,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351541179] [2022-11-23 16:09:39,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:09:39,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:09:39,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:09:39,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:09:39,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 16:09:39,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 16:09:39,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:09:39,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-23 16:09:39,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:09:39,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:09:39,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:09:40,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:09:40,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 44 treesize of output 20 [2022-11-23 16:09:40,521 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-23 16:09:40,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:09:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:09:41,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351541179] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:09:41,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1653492104] [2022-11-23 16:09:41,280 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:336) 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-23 16:09:41,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:09:41,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2022-11-23 16:09:41,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317298015] [2022-11-23 16:09:41,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:09:41,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 16:09:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:09:41,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 16:09:41,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=470, Unknown=6, NotChecked=0, Total=552 [2022-11-23 16:09:41,284 INFO L87 Difference]: Start difference. First operand 104 states and 301 transitions. Second operand has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:09:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:09:43,118 INFO L93 Difference]: Finished difference Result 227 states and 651 transitions. [2022-11-23 16:09:43,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 16:09:43,119 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:09:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:09:43,121 INFO L225 Difference]: With dead ends: 227 [2022-11-23 16:09:43,121 INFO L226 Difference]: Without dead ends: 217 [2022-11-23 16:09:43,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=271, Invalid=1283, Unknown=6, NotChecked=0, Total=1560 [2022-11-23 16:09:43,123 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 16:09:43,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 16:09:43,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-23 16:09:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 105. [2022-11-23 16:09:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.951923076923077) internal successors, (307), 104 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:09:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 307 transitions. [2022-11-23 16:09:43,132 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 307 transitions. Word has length 16 [2022-11-23 16:09:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:09:43,132 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 307 transitions. [2022-11-23 16:09:43,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:09:43,133 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 307 transitions. [2022-11-23 16:09:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:09:43,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:09:43,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:09:43,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-23 16:09:43,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:09:43,341 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:09:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:09:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1548453273, now seen corresponding path program 6 times [2022-11-23 16:09:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:09:43,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823388638] [2022-11-23 16:09:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:09:43,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:09:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:09:44,593 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-23 16:09:44,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:09:44,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823388638] [2022-11-23 16:09:44,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823388638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:09:44,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388438776] [2022-11-23 16:09:44,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:09:44,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:09:44,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:09:44,595 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:09:44,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 16:09:44,743 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:09:44,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:09:44,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-23 16:09:44,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:09:44,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 15 treesize of output 11 [2022-11-23 16:09:44,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:09:45,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:09:45,482 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 31 treesize of output 15 [2022-11-23 16:09:45,605 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-23 16:09:45,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:09:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:09:46,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388438776] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:09:46,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1799088198] [2022-11-23 16:09:46,586 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:336) 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-23 16:09:46,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:09:46,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 24 [2022-11-23 16:09:46,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202839198] [2022-11-23 16:09:46,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:09:46,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 16:09:46,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:09:46,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 16:09:46,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=520, Unknown=3, NotChecked=0, Total=600 [2022-11-23 16:09:46,590 INFO L87 Difference]: Start difference. First operand 105 states and 307 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:09:47,747 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (not (< c_~j~0 c_~N~0))) (.cse2 (+ c_~A~0.offset (* c_~i~0 4))) (.cse4 (+ c_~A~0.offset (* c_~j~0 4))) (.cse8 (< (+ c_~i~0 1) c_~N~0)) (.cse0 (+ c_~bag1~0 c_~sum1~0))) (and (<= .cse0 c_~sum2~0) (or (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse3 (select .cse1 .cse4))) (or (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse1 .cse2) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse3 c_~bag2~0 c_~sum2~0 1)) (not (<= 0 (+ .cse3 c_~bag2~0 2147483648))) (not (<= (+ .cse3 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse4))) (or (<= (+ .cse5 c_~bag2~0 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse6 .cse2) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ .cse5 c_~bag2~0 2147483648))) (not (<= (+ .cse5 c_~bag2~0) 2147483647))))))) .cse7 .cse8) (<= c_~sum2~0 2147483647) (= c_~sum1~0 c_~sum2~0) (or (not (< c_~i~0 c_~N~0)) .cse7 (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse4))) (or (<= (+ .cse9 c_~bag2~0 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse10 .cse2))) (not (<= 0 (+ .cse9 c_~bag2~0 2147483648))) (not (<= (+ .cse9 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse4))) (or (not (<= 0 (+ .cse11 c_~bag2~0 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse12 .cse2)) (+ .cse11 c_~bag2~0 c_~sum2~0 1)) (not (<= (+ .cse11 c_~bag2~0) 2147483647))))))) .cse8) (<= 0 (+ c_~sum2~0 2147483648)) (<= c_~sum2~0 .cse0))) is different from false [2022-11-23 16:09:52,356 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (not (< c_~j~0 c_~N~0))) (.cse1 (+ c_~A~0.offset (* c_~i~0 4))) (.cse3 (+ c_~A~0.offset (* c_~j~0 4))) (.cse7 (< (+ c_~i~0 1) c_~N~0)) (.cse8 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (= c_~sum1~0 0) (<= 0 (+ c_~bag1~0 2147483648)) (or (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse2 (select .cse0 .cse3))) (or (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse0 .cse1) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse2 c_~bag2~0 c_~sum2~0 1)) (not (<= 0 (+ .cse2 c_~bag2~0 2147483648))) (not (<= (+ .cse2 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse4 (select .cse5 .cse3))) (or (<= (+ .cse4 c_~bag2~0 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse5 .cse1) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ .cse4 c_~bag2~0 2147483648))) (not (<= (+ .cse4 c_~bag2~0) 2147483647))))))) .cse6 .cse7) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= .cse8 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~sum2~0 2147483647) (<= c_~N~0 1) (= c_~sum1~0 c_~sum2~0) (<= c_~bag1~0 2147483647) (or (not (< c_~i~0 c_~N~0)) .cse6 (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse3))) (or (<= (+ .cse9 c_~bag2~0 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse10 .cse1))) (not (<= 0 (+ .cse9 c_~bag2~0 2147483648))) (not (<= (+ .cse9 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse11 (select .cse12 .cse3))) (or (not (<= 0 (+ .cse11 c_~bag2~0 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse12 .cse1)) (+ .cse11 c_~bag2~0 c_~sum2~0 1)) (not (<= (+ .cse11 c_~bag2~0) 2147483647))))))) .cse7) (< 0 c_~N~0) (<= 0 (+ c_~sum2~0 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~bag1~0 c_~sum2~0) (<= c_~i~0 1))) is different from false [2022-11-23 16:09:52,900 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (= c_~sum1~0 0) (<= 0 (+ c_~bag1~0 2147483648)) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~sum2~0 2147483647) (<= c_~N~0 1) (= c_~sum1~0 c_~sum2~0) (<= c_~bag1~0 2147483647) (or (not (< c_~i~0 c_~N~0)) (not (< c_~j~0 c_~N~0)) (let ((.cse3 (+ c_~A~0.offset (* c_~i~0 4))) (.cse4 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4))) (or (<= (+ .cse1 c_~bag2~0 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse2 .cse3))) (not (<= 0 (+ .cse1 c_~bag2~0 2147483648))) (not (<= (+ .cse1 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse4))) (or (not (<= 0 (+ .cse5 c_~bag2~0 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse6 .cse3)) (+ .cse5 c_~bag2~0 c_~sum2~0 1)) (not (<= (+ .cse5 c_~bag2~0) 2147483647)))))))) (< (+ c_~i~0 1) c_~N~0)) (< 0 c_~N~0) (<= 0 (+ c_~sum2~0 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~bag1~0 c_~sum2~0) (<= c_~i~0 1))) is different from false [2022-11-23 16:09:54,955 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~A~0.base)) (.cse7 (+ c_~A~0.offset (* c_~i~0 4)))) (let ((.cse3 (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse4 .cse7) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (.cse1 (not (< c_~j~0 c_~N~0))) (.cse5 (+ c_~A~0.offset (* c_~j~0 4))) (.cse2 (< (+ c_~i~0 1) c_~N~0)) (.cse11 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (let ((.cse0 (select .cse4 .cse5))) (or (not (<= (+ c_~bag2~0 .cse0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse0 2147483648))) .cse1 .cse2 (and (< .cse3 (+ c_~bag2~0 .cse0 c_~sum2~0 1)) (<= (+ c_~bag2~0 .cse0 c_~sum2~0) .cse3)))) (or (and (< .cse3 (+ c_~sum2~0 1)) (<= c_~sum2~0 .cse3)) .cse2) (or (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse8 (select .cse6 .cse5))) (or (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse6 .cse7) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse8 c_~bag2~0 c_~sum2~0 1)) (not (<= 0 (+ .cse8 c_~bag2~0 2147483648))) (not (<= (+ .cse8 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse5))) (or (<= (+ .cse9 c_~bag2~0 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse10 .cse7) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ .cse9 c_~bag2~0 2147483648))) (not (<= (+ .cse9 c_~bag2~0) 2147483647))))))) .cse1 .cse2) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= .cse11 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (< c_~i~0 c_~N~0)) .cse1 (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse5))) (or (<= (+ .cse12 c_~bag2~0 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse13 .cse7))) (not (<= 0 (+ .cse12 c_~bag2~0 2147483648))) (not (<= (+ .cse12 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse5))) (or (not (<= 0 (+ .cse14 c_~bag2~0 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse15 .cse7)) (+ .cse14 c_~bag2~0 c_~sum2~0 1)) (not (<= (+ .cse14 c_~bag2~0) 2147483647))))))) .cse2) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2022-11-23 16:09:55,414 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (= c_~sum1~0 0) (<= 0 (+ c_~bag1~0 2147483648)) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~N~0 1) (<= c_~bag1~0 2147483647) (or (not (< c_~i~0 c_~N~0)) (not (< c_~j~0 c_~N~0)) (let ((.cse3 (+ c_~A~0.offset (* c_~i~0 4))) (.cse4 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4))) (or (<= (+ .cse1 c_~bag2~0 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse2 .cse3))) (not (<= 0 (+ .cse1 c_~bag2~0 2147483648))) (not (<= (+ .cse1 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse4))) (or (not (<= 0 (+ .cse5 c_~bag2~0 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse6 .cse3)) (+ .cse5 c_~bag2~0 c_~sum2~0 1)) (not (<= (+ .cse5 c_~bag2~0) 2147483647)))))))) (< (+ c_~i~0 1) c_~N~0)) (< 0 c_~N~0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~bag1~0 c_~sum2~0) (<= c_~i~0 1))) is different from false [2022-11-23 16:09:56,066 WARN L837 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ c_~bag1~0 c_~sum1~0))) (and (< .cse0 (+ c_~sum2~0 1)) (<= c_~sum2~0 .cse0))) (< c_~i~0 c_~N~0)) (or (let ((.cse2 (+ c_~A~0.offset (* c_~i~0 4))) (.cse4 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse3 (select .cse1 .cse4))) (or (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse1 .cse2) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse3 c_~bag2~0 c_~sum2~0 1)) (not (<= 0 (+ .cse3 c_~bag2~0 2147483648))) (not (<= (+ .cse3 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse4))) (or (<= (+ .cse5 c_~bag2~0 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse6 .cse2) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ .cse5 c_~bag2~0 2147483648))) (not (<= (+ .cse5 c_~bag2~0) 2147483647)))))))) (not (< c_~j~0 c_~N~0)) (< (+ c_~i~0 1) c_~N~0))) is different from false [2022-11-23 16:09:56,378 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~i~0 c_~N~0)) (.cse8 (not (< c_~j~0 c_~N~0))) (.cse3 (+ c_~A~0.offset (* c_~i~0 4))) (.cse5 (+ c_~A~0.offset (* c_~j~0 4))) (.cse9 (< (+ c_~i~0 1) c_~N~0))) (and (or (let ((.cse0 (+ c_~bag1~0 c_~sum1~0))) (and (< .cse0 (+ c_~sum2~0 1)) (<= c_~sum2~0 .cse0))) .cse1) (or (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse4 (select .cse2 .cse5))) (or (< (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse2 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (+ .cse4 c_~bag2~0 c_~sum2~0 1)) (not (<= 0 (+ .cse4 c_~bag2~0 2147483648))) (not (<= (+ .cse4 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse5))) (or (<= (+ .cse6 c_~bag2~0 c_~sum2~0) (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| (select .cse7 .cse3) |c_thread1Thread1of1ForFork0_plus_#in~a#1|)) (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (not (<= (+ .cse6 c_~bag2~0) 2147483647))))))) .cse8 .cse9) (or (not .cse1) .cse8 (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse5))) (or (<= (+ .cse10 c_~bag2~0 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse11 .cse3))) (not (<= 0 (+ .cse10 c_~bag2~0 2147483648))) (not (<= (+ .cse10 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse5))) (or (not (<= 0 (+ .cse12 c_~bag2~0 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse13 .cse3)) (+ .cse12 c_~bag2~0 c_~sum2~0 1)) (not (<= (+ .cse12 c_~bag2~0) 2147483647))))))) .cse9))) is different from false [2022-11-23 16:09:56,402 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~i~0 c_~N~0))) (and (or (let ((.cse0 (+ c_~bag1~0 c_~sum1~0))) (and (< .cse0 (+ c_~sum2~0 1)) (<= c_~sum2~0 .cse0))) .cse1) (or (not .cse1) (not (< c_~j~0 c_~N~0)) (let ((.cse4 (+ c_~A~0.offset (* c_~i~0 4))) (.cse5 (+ c_~A~0.offset (* c_~j~0 4)))) (and (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse5))) (or (<= (+ .cse2 c_~bag2~0 c_~sum2~0) (+ c_~bag1~0 c_~sum1~0 (select .cse3 .cse4))) (not (<= 0 (+ .cse2 c_~bag2~0 2147483648))) (not (<= (+ .cse2 c_~bag2~0) 2147483647)))))) (forall ((v_ArrVal_303 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_303) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse5))) (or (not (<= 0 (+ .cse6 c_~bag2~0 2147483648))) (< (+ c_~bag1~0 c_~sum1~0 (select .cse7 .cse4)) (+ .cse6 c_~bag2~0 c_~sum2~0 1)) (not (<= (+ .cse6 c_~bag2~0) 2147483647)))))))) (< (+ c_~i~0 1) c_~N~0)))) is different from false [2022-11-23 16:09:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:09:57,224 INFO L93 Difference]: Finished difference Result 339 states and 873 transitions. [2022-11-23 16:09:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-23 16:09:57,224 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:09:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:09:57,227 INFO L225 Difference]: With dead ends: 339 [2022-11-23 16:09:57,228 INFO L226 Difference]: Without dead ends: 329 [2022-11-23 16:09:57,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=480, Invalid=2382, Unknown=32, NotChecked=888, Total=3782 [2022-11-23 16:09:57,230 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 44 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-23 16:09:57,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 925 Invalid, 31 Unknown, 93 Unchecked, 1.9s Time] [2022-11-23 16:09:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-23 16:09:57,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 123. [2022-11-23 16:09:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.8934426229508197) internal successors, (353), 122 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:09:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 353 transitions. [2022-11-23 16:09:57,245 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 353 transitions. Word has length 16 [2022-11-23 16:09:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:09:57,246 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 353 transitions. [2022-11-23 16:09:57,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:09:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 353 transitions. [2022-11-23 16:09:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:09:57,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:09:57,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:09:57,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 16:09:57,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 16:09:57,452 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:09:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:09:57,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1599838125, now seen corresponding path program 7 times [2022-11-23 16:09:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:09:57,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543015468] [2022-11-23 16:09:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:09:57,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:09:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:09:59,178 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-23 16:09:59,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:09:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543015468] [2022-11-23 16:09:59,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543015468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:09:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844792036] [2022-11-23 16:09:59,180 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 16:09:59,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:09:59,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:09:59,181 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:09:59,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 16:09:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:09:59,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-23 16:09:59,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:09:59,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:09:59,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:09:59,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:09:59,754 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 31 treesize of output 15 [2022-11-23 16:09:59,929 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-23 16:09:59,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:10:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:10:00,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844792036] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:10:00,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [264253417] [2022-11-23 16:10:00,721 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:336) 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-23 16:10:00,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:10:00,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 24 [2022-11-23 16:10:00,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640424736] [2022-11-23 16:10:00,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:10:00,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 16:10:00,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:00,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 16:10:00,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=515, Unknown=14, NotChecked=0, Total=600 [2022-11-23 16:10:00,723 INFO L87 Difference]: Start difference. First operand 123 states and 353 transitions. Second operand has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:05,235 INFO L93 Difference]: Finished difference Result 301 states and 872 transitions. [2022-11-23 16:10:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-23 16:10:05,236 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:10:05,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:05,238 INFO L225 Difference]: With dead ends: 301 [2022-11-23 16:10:05,238 INFO L226 Difference]: Without dead ends: 296 [2022-11-23 16:10:05,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=588, Invalid=2704, Unknown=14, NotChecked=0, Total=3306 [2022-11-23 16:10:05,240 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 309 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:05,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 0 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 16:10:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-23 16:10:05,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 124. [2022-11-23 16:10:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.8536585365853657) internal successors, (351), 123 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 351 transitions. [2022-11-23 16:10:05,249 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 351 transitions. Word has length 16 [2022-11-23 16:10:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:05,250 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 351 transitions. [2022-11-23 16:10:05,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 351 transitions. [2022-11-23 16:10:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:10:05,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:05,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:05,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-23 16:10:05,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 16:10:05,458 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:10:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:05,459 INFO L85 PathProgramCache]: Analyzing trace with hash 595894339, now seen corresponding path program 8 times [2022-11-23 16:10:05,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:05,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584304909] [2022-11-23 16:10:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:05,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:06,667 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-23 16:10:06,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:06,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584304909] [2022-11-23 16:10:06,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584304909] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:10:06,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322992101] [2022-11-23 16:10:06,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:10:06,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:06,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:10:06,672 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:10:06,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 16:10:06,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 16:10:06,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:10:06,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-23 16:10:06,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:10:06,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:10:06,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:10:07,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:10:07,620 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 56 treesize of output 28 [2022-11-23 16:10:07,785 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-23 16:10:07,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:10:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:10:08,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322992101] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:10:08,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [284614097] [2022-11-23 16:10:08,506 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:336) 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-23 16:10:08,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:10:08,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 22 [2022-11-23 16:10:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957277782] [2022-11-23 16:10:08,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:10:08,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-23 16:10:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:08,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-23 16:10:08,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=432, Unknown=6, NotChecked=0, Total=506 [2022-11-23 16:10:08,508 INFO L87 Difference]: Start difference. First operand 124 states and 351 transitions. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:10,480 INFO L93 Difference]: Finished difference Result 252 states and 694 transitions. [2022-11-23 16:10:10,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 16:10:10,481 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:10:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:10,483 INFO L225 Difference]: With dead ends: 252 [2022-11-23 16:10:10,483 INFO L226 Difference]: Without dead ends: 243 [2022-11-23 16:10:10,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=250, Invalid=1226, Unknown=6, NotChecked=0, Total=1482 [2022-11-23 16:10:10,486 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 190 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:10,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 0 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 16:10:10,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-23 16:10:10,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 117. [2022-11-23 16:10:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.8620689655172415) internal successors, (332), 116 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 332 transitions. [2022-11-23 16:10:10,497 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 332 transitions. Word has length 16 [2022-11-23 16:10:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:10,499 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 332 transitions. [2022-11-23 16:10:10,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 332 transitions. [2022-11-23 16:10:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:10:10,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:10,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:10,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 16:10:10,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 16:10:10,707 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:10:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash -917332789, now seen corresponding path program 1 times [2022-11-23 16:10:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:10,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551662090] [2022-11-23 16:10:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:12,158 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-23 16:10:12,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:12,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551662090] [2022-11-23 16:10:12,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551662090] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:10:12,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272313484] [2022-11-23 16:10:12,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:12,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:12,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:10:12,161 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:10:12,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 16:10:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:12,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-23 16:10:12,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:10:12,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:10:12,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:10:12,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:10:12,839 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 56 treesize of output 24 [2022-11-23 16:10:12,946 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-23 16:10:12,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:10:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:10:13,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272313484] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:10:13,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [559574859] [2022-11-23 16:10:13,757 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:336) 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-23 16:10:13,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:10:13,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2022-11-23 16:10:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307942496] [2022-11-23 16:10:13,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:10:13,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-23 16:10:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:13,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-23 16:10:13,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=393, Unknown=2, NotChecked=0, Total=462 [2022-11-23 16:10:13,760 INFO L87 Difference]: Start difference. First operand 117 states and 332 transitions. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:25,497 WARN L233 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 106 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:10:28,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:28,310 INFO L93 Difference]: Finished difference Result 223 states and 607 transitions. [2022-11-23 16:10:28,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 16:10:28,311 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:10:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:28,312 INFO L225 Difference]: With dead ends: 223 [2022-11-23 16:10:28,312 INFO L226 Difference]: Without dead ends: 218 [2022-11-23 16:10:28,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=270, Invalid=1210, Unknown=2, NotChecked=0, Total=1482 [2022-11-23 16:10:28,313 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 23 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:28,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 697 Invalid, 5 Unknown, 0 Unchecked, 1.2s Time] [2022-11-23 16:10:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-23 16:10:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 129. [2022-11-23 16:10:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.90625) internal successors, (372), 128 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 372 transitions. [2022-11-23 16:10:28,319 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 372 transitions. Word has length 16 [2022-11-23 16:10:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:28,320 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 372 transitions. [2022-11-23 16:10:28,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 372 transitions. [2022-11-23 16:10:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:10:28,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:28,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:28,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 16:10:28,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 16:10:28,526 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:10:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:28,527 INFO L85 PathProgramCache]: Analyzing trace with hash -59052905, now seen corresponding path program 2 times [2022-11-23 16:10:28,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:28,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144841317] [2022-11-23 16:10:28,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:28,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:10:29,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:29,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144841317] [2022-11-23 16:10:29,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144841317] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:10:29,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267484486] [2022-11-23 16:10:29,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:10:29,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:29,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:10:29,513 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:10:29,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 16:10:29,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 16:10:29,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:10:29,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-23 16:10:29,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:10:29,930 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 31 treesize of output 15 [2022-11-23 16:10:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:10:30,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:10:30,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:10:30,236 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 313 treesize of output 245 [2022-11-23 16:10:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:10:30,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267484486] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:10:30,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [439379] [2022-11-23 16:10:30,517 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:336) 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-23 16:10:30,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:10:30,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-11-23 16:10:30,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484032734] [2022-11-23 16:10:30,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:10:30,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 16:10:30,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:30,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 16:10:30,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-11-23 16:10:30,520 INFO L87 Difference]: Start difference. First operand 129 states and 372 transitions. Second operand has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:10:31,197 INFO L93 Difference]: Finished difference Result 199 states and 580 transitions. [2022-11-23 16:10:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 16:10:31,197 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:10:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:10:31,199 INFO L225 Difference]: With dead ends: 199 [2022-11-23 16:10:31,199 INFO L226 Difference]: Without dead ends: 194 [2022-11-23 16:10:31,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-11-23 16:10:31,201 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 16:10:31,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 16:10:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-23 16:10:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 129. [2022-11-23 16:10:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.90625) internal successors, (372), 128 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 372 transitions. [2022-11-23 16:10:31,208 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 372 transitions. Word has length 16 [2022-11-23 16:10:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:10:31,208 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 372 transitions. [2022-11-23 16:10:31,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 372 transitions. [2022-11-23 16:10:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:10:31,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:10:31,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:10:31,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-23 16:10:31,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 16:10:31,416 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:10:31,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:10:31,417 INFO L85 PathProgramCache]: Analyzing trace with hash -31347275, now seen corresponding path program 3 times [2022-11-23 16:10:31,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:10:31,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665948001] [2022-11-23 16:10:31,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:10:31,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:10:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:10:33,095 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-23 16:10:33,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:10:33,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665948001] [2022-11-23 16:10:33,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665948001] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:10:33,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340310440] [2022-11-23 16:10:33,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:10:33,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:10:33,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:10:33,097 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:10:33,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 16:10:33,230 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:10:33,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:10:33,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-23 16:10:33,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:10:33,284 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-23 16:10:33,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:10:33,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:10:33,824 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 54 treesize of output 22 [2022-11-23 16:10:33,993 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-23 16:10:33,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:10:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:10:34,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340310440] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:10:34,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1248022586] [2022-11-23 16:10:34,861 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:336) 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-23 16:10:34,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:10:34,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-11-23 16:10:34,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617450786] [2022-11-23 16:10:34,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:10:34,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 16:10:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:10:34,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 16:10:34,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=503, Unknown=4, NotChecked=0, Total=600 [2022-11-23 16:10:34,864 INFO L87 Difference]: Start difference. First operand 129 states and 372 transitions. Second operand has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:10:46,387 WARN L233 SmtUtils]: Spent 10.30s on a formula simplification. DAG size of input: 95 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:11:11,486 WARN L233 SmtUtils]: Spent 14.70s on a formula simplification. DAG size of input: 120 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:11:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:11:21,851 INFO L93 Difference]: Finished difference Result 566 states and 1504 transitions. [2022-11-23 16:11:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-23 16:11:21,852 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:11:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:11:21,856 INFO L225 Difference]: With dead ends: 566 [2022-11-23 16:11:21,856 INFO L226 Difference]: Without dead ends: 551 [2022-11-23 16:11:21,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=1023, Invalid=5613, Unknown=6, NotChecked=0, Total=6642 [2022-11-23 16:11:21,859 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 493 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 91 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-23 16:11:21,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 0 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 856 Invalid, 19 Unknown, 0 Unchecked, 1.9s Time] [2022-11-23 16:11:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-11-23 16:11:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 142. [2022-11-23 16:11:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.9645390070921986) internal successors, (418), 141 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 418 transitions. [2022-11-23 16:11:21,869 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 418 transitions. Word has length 16 [2022-11-23 16:11:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:11:21,869 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 418 transitions. [2022-11-23 16:11:21,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 418 transitions. [2022-11-23 16:11:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:11:21,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:11:21,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:11:21,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 16:11:22,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 16:11:22,077 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:11:22,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:11:22,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1924748381, now seen corresponding path program 9 times [2022-11-23 16:11:22,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:11:22,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157501999] [2022-11-23 16:11:22,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:11:22,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:11:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:11:23,306 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-23 16:11:23,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:11:23,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157501999] [2022-11-23 16:11:23,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157501999] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:11:23,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805807441] [2022-11-23 16:11:23,307 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:11:23,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:11:23,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:11:23,308 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:11:23,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 16:11:23,443 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:11:23,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:11:23,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-23 16:11:23,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:11:23,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:11:23,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:11:23,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:11:23,974 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 58 treesize of output 22 [2022-11-23 16:11:24,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-23 16:11:24,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:11:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:11:25,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805807441] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:11:25,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [999859528] [2022-11-23 16:11:25,015 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:336) 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-23 16:11:25,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:11:25,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 24 [2022-11-23 16:11:25,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113074390] [2022-11-23 16:11:25,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:11:25,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 16:11:25,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:11:25,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 16:11:25,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=502, Unknown=1, NotChecked=0, Total=600 [2022-11-23 16:11:25,020 INFO L87 Difference]: Start difference. First operand 142 states and 418 transitions. Second operand has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:44,288 WARN L233 SmtUtils]: Spent 18.81s on a formula simplification. DAG size of input: 115 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:11:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:11:57,447 INFO L93 Difference]: Finished difference Result 577 states and 1547 transitions. [2022-11-23 16:11:57,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-23 16:11:57,447 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:11:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:11:57,450 INFO L225 Difference]: With dead ends: 577 [2022-11-23 16:11:57,450 INFO L226 Difference]: Without dead ends: 562 [2022-11-23 16:11:57,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3009 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=1430, Invalid=7484, Unknown=16, NotChecked=0, Total=8930 [2022-11-23 16:11:57,453 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 455 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 116 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-23 16:11:57,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 0 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1182 Invalid, 36 Unknown, 0 Unchecked, 2.5s Time] [2022-11-23 16:11:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-23 16:11:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 153. [2022-11-23 16:11:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.0197368421052633) internal successors, (459), 152 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 459 transitions. [2022-11-23 16:11:57,464 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 459 transitions. Word has length 16 [2022-11-23 16:11:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:11:57,465 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 459 transitions. [2022-11-23 16:11:57,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:11:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 459 transitions. [2022-11-23 16:11:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:11:57,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:11:57,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:11:57,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-23 16:11:57,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-23 16:11:57,672 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:11:57,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:11:57,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1952454011, now seen corresponding path program 10 times [2022-11-23 16:11:57,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:11:57,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547488624] [2022-11-23 16:11:57,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:11:57,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:11:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:11:58,988 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-23 16:11:58,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:11:58,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547488624] [2022-11-23 16:11:58,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547488624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:11:58,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599410572] [2022-11-23 16:11:58,989 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 16:11:58,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:11:58,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:11:58,991 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:11:59,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 16:11:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:11:59,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-23 16:11:59,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:11:59,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:11:59,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:11:59,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:11:59,712 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 31 treesize of output 15 [2022-11-23 16:11:59,879 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-23 16:11:59,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:12:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:12:00,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599410572] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:12:00,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [903947178] [2022-11-23 16:12:00,640 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:336) 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-23 16:12:00,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:12:00,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2022-11-23 16:12:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037818248] [2022-11-23 16:12:00,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:12:00,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 16:12:00,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:00,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 16:12:00,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=509, Unknown=3, NotChecked=0, Total=600 [2022-11-23 16:12:00,645 INFO L87 Difference]: Start difference. First operand 153 states and 459 transitions. Second operand has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:12,508 WARN L233 SmtUtils]: Spent 6.58s on a formula simplification. DAG size of input: 109 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:12:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:12:14,729 INFO L93 Difference]: Finished difference Result 269 states and 811 transitions. [2022-11-23 16:12:14,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 16:12:14,730 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:12:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:12:14,732 INFO L225 Difference]: With dead ends: 269 [2022-11-23 16:12:14,732 INFO L226 Difference]: Without dead ends: 264 [2022-11-23 16:12:14,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=295, Invalid=1508, Unknown=3, NotChecked=0, Total=1806 [2022-11-23 16:12:14,733 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:12:14,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 719 Invalid, 3 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 16:12:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-23 16:12:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 155. [2022-11-23 16:12:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 3.012987012987013) internal successors, (464), 154 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 464 transitions. [2022-11-23 16:12:14,741 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 464 transitions. Word has length 16 [2022-11-23 16:12:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:12:14,742 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 464 transitions. [2022-11-23 16:12:14,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 464 transitions. [2022-11-23 16:12:14,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:12:14,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:14,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:14,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 16:12:14,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-23 16:12:14,956 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:12:14,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:14,956 INFO L85 PathProgramCache]: Analyzing trace with hash -652469855, now seen corresponding path program 11 times [2022-11-23 16:12:14,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:14,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546502990] [2022-11-23 16:12:14,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:14,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:12:15,937 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-23 16:12:15,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:12:15,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546502990] [2022-11-23 16:12:15,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546502990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:12:15,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027713635] [2022-11-23 16:12:15,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:12:15,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:12:15,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:12:15,940 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:12:15,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 16:12:16,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 16:12:16,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:12:16,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-23 16:12:16,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:12:16,568 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 31 treesize of output 15 [2022-11-23 16:12:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:12:16,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:12:16,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:12:16,927 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 313 treesize of output 245 [2022-11-23 16:12:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:12:17,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027713635] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:12:17,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [770149059] [2022-11-23 16:12:17,106 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:336) 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-23 16:12:17,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:12:17,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-11-23 16:12:17,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149893332] [2022-11-23 16:12:17,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:12:17,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 16:12:17,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:17,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 16:12:17,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-11-23 16:12:17,108 INFO L87 Difference]: Start difference. First operand 155 states and 464 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:12:18,172 INFO L93 Difference]: Finished difference Result 297 states and 844 transitions. [2022-11-23 16:12:18,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 16:12:18,172 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:12:18,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:12:18,174 INFO L225 Difference]: With dead ends: 297 [2022-11-23 16:12:18,174 INFO L226 Difference]: Without dead ends: 287 [2022-11-23 16:12:18,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 16:12:18,176 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 16:12:18,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 16:12:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-23 16:12:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 155. [2022-11-23 16:12:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 3.012987012987013) internal successors, (464), 154 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 464 transitions. [2022-11-23 16:12:18,184 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 464 transitions. Word has length 16 [2022-11-23 16:12:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:12:18,184 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 464 transitions. [2022-11-23 16:12:18,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:18,185 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 464 transitions. [2022-11-23 16:12:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 16:12:18,186 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:12:18,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:12:18,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-23 16:12:18,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:12:18,393 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:12:18,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:12:18,393 INFO L85 PathProgramCache]: Analyzing trace with hash 147534721, now seen corresponding path program 12 times [2022-11-23 16:12:18,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:12:18,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016539644] [2022-11-23 16:12:18,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:12:18,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:12:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:12:19,408 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-23 16:12:19,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:12:19,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016539644] [2022-11-23 16:12:19,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016539644] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:12:19,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436877354] [2022-11-23 16:12:19,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:12:19,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:12:19,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:12:19,410 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:12:19,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-23 16:12:19,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:12:19,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:12:19,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-23 16:12:19,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:12:19,600 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-23 16:12:19,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:12:19,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:12:20,120 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 31 treesize of output 15 [2022-11-23 16:12:20,221 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-23 16:12:20,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:12:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:12:20,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436877354] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:12:20,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [447675988] [2022-11-23 16:12:20,930 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:336) 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-23 16:12:20,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:12:20,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2022-11-23 16:12:20,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135909086] [2022-11-23 16:12:20,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:12:20,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 16:12:20,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:12:20,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 16:12:20,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=475, Unknown=3, NotChecked=0, Total=552 [2022-11-23 16:12:20,932 INFO L87 Difference]: Start difference. First operand 155 states and 464 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:12:30,680 WARN L233 SmtUtils]: Spent 8.45s on a formula simplification. DAG size of input: 83 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:12:47,980 WARN L233 SmtUtils]: Spent 8.50s on a formula simplification. DAG size of input: 92 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:13:04,120 WARN L233 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 99 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:13:13,933 WARN L233 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 103 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:13:24,923 WARN L233 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 118 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:13:31,596 WARN L233 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 104 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:13:40,209 WARN L233 SmtUtils]: Spent 8.45s on a formula simplification. DAG size of input: 87 DAG size of output: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:13:49,335 WARN L233 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 88 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:13:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:13:52,400 INFO L93 Difference]: Finished difference Result 657 states and 1724 transitions. [2022-11-23 16:13:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-23 16:13:52,400 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 16:13:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:13:52,404 INFO L225 Difference]: With dead ends: 657 [2022-11-23 16:13:52,404 INFO L226 Difference]: Without dead ends: 637 [2022-11-23 16:13:52,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2563 ImplicationChecksByTransitivity, 89.9s TimeCoverageRelationStatistics Valid=1478, Invalid=6526, Unknown=6, NotChecked=0, Total=8010 [2022-11-23 16:13:52,407 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 470 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 144 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-23 16:13:52,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 0 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1229 Invalid, 10 Unknown, 0 Unchecked, 2.3s Time] [2022-11-23 16:13:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-11-23 16:13:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 185. [2022-11-23 16:13:52,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 3.0380434782608696) internal successors, (559), 184 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 559 transitions. [2022-11-23 16:13:52,418 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 559 transitions. Word has length 16 [2022-11-23 16:13:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:13:52,419 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 559 transitions. [2022-11-23 16:13:52,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 559 transitions. [2022-11-23 16:13:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 16:13:52,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:13:52,420 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:13:52,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-23 16:13:52,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:13:52,632 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:13:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:13:52,632 INFO L85 PathProgramCache]: Analyzing trace with hash -722838731, now seen corresponding path program 13 times [2022-11-23 16:13:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:13:52,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994745853] [2022-11-23 16:13:52,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:13:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:13:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:13:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:13:52,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:13:52,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994745853] [2022-11-23 16:13:52,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994745853] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:13:52,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757096576] [2022-11-23 16:13:52,918 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 16:13:52,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:13:52,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:13:52,924 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:13:52,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-23 16:13:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:13:53,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 16:13:53,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:13:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:13:53,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:13:53,479 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 16:13:53,480 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 376 treesize of output 272 [2022-11-23 16:13:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:13:53,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757096576] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:13:53,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [183571980] [2022-11-23 16:13:53,633 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:336) 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-23 16:13:53,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:13:53,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-11-23 16:13:53,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833266011] [2022-11-23 16:13:53,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:13:53,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 16:13:53,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:13:53,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 16:13:53,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-23 16:13:53,634 INFO L87 Difference]: Start difference. First operand 185 states and 559 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:13:54,538 INFO L93 Difference]: Finished difference Result 333 states and 874 transitions. [2022-11-23 16:13:54,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 16:13:54,538 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 16:13:54,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:13:54,540 INFO L225 Difference]: With dead ends: 333 [2022-11-23 16:13:54,540 INFO L226 Difference]: Without dead ends: 315 [2022-11-23 16:13:54,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2022-11-23 16:13:54,541 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 268 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 16:13:54,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 0 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 16:13:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-23 16:13:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 221. [2022-11-23 16:13:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 2.8227272727272728) internal successors, (621), 220 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 621 transitions. [2022-11-23 16:13:54,550 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 621 transitions. Word has length 17 [2022-11-23 16:13:54,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:13:54,550 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 621 transitions. [2022-11-23 16:13:54,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 621 transitions. [2022-11-23 16:13:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 16:13:54,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:13:54,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:13:54,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-23 16:13:54,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:13:54,758 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:13:54,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:13:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1411721249, now seen corresponding path program 14 times [2022-11-23 16:13:54,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:13:54,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774578002] [2022-11-23 16:13:54,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:13:54,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:13:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:13:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:13:54,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:13:54,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774578002] [2022-11-23 16:13:54,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774578002] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:13:54,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383437828] [2022-11-23 16:13:54,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:13:54,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:13:54,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:13:54,920 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:13:54,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-23 16:13:55,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 16:13:55,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:13:55,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 16:13:55,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:13:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:13:55,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:13:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:13:55,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383437828] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:13:55,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1291361265] [2022-11-23 16:13:55,225 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:336) 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-23 16:13:55,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:13:55,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-23 16:13:55,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841456193] [2022-11-23 16:13:55,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:13:55,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 16:13:55,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:13:55,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 16:13:55,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-23 16:13:55,228 INFO L87 Difference]: Start difference. First operand 221 states and 621 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:13:55,407 INFO L93 Difference]: Finished difference Result 174 states and 458 transitions. [2022-11-23 16:13:55,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 16:13:55,407 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 16:13:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:13:55,408 INFO L225 Difference]: With dead ends: 174 [2022-11-23 16:13:55,408 INFO L226 Difference]: Without dead ends: 129 [2022-11-23 16:13:55,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-23 16:13:55,409 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:13:55,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:13:55,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-23 16:13:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-23 16:13:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.9140625) internal successors, (373), 128 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 373 transitions. [2022-11-23 16:13:55,414 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 373 transitions. Word has length 18 [2022-11-23 16:13:55,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:13:55,414 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 373 transitions. [2022-11-23 16:13:55,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 373 transitions. [2022-11-23 16:13:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 16:13:55,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:13:55,415 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:13:55,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-23 16:13:55,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:13:55,616 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:13:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:13:55,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1196321664, now seen corresponding path program 15 times [2022-11-23 16:13:55,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:13:55,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795157616] [2022-11-23 16:13:55,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:13:55,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:13:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:13:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 16:13:55,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:13:55,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795157616] [2022-11-23 16:13:55,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795157616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:13:55,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776074460] [2022-11-23 16:13:55,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:13:55,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:13:55,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:13:55,814 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:13:55,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-23 16:13:55,964 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:13:55,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:13:55,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 16:13:55,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:13:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 16:13:56,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:13:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 16:13:56,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776074460] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:13:56,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [33790566] [2022-11-23 16:13:56,152 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) 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-23 16:13:56,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:13:56,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-23 16:13:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090127624] [2022-11-23 16:13:56,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:13:56,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 16:13:56,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:13:56,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 16:13:56,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-23 16:13:56,153 INFO L87 Difference]: Start difference. First operand 129 states and 373 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:56,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:13:56,336 INFO L93 Difference]: Finished difference Result 153 states and 442 transitions. [2022-11-23 16:13:56,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 16:13:56,336 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 16:13:56,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:13:56,338 INFO L225 Difference]: With dead ends: 153 [2022-11-23 16:13:56,338 INFO L226 Difference]: Without dead ends: 153 [2022-11-23 16:13:56,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-11-23 16:13:56,339 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:13:56,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 0 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:13:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-23 16:13:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 107. [2022-11-23 16:13:56,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.7452830188679247) internal successors, (291), 106 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:56,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 291 transitions. [2022-11-23 16:13:56,343 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 291 transitions. Word has length 18 [2022-11-23 16:13:56,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:13:56,343 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 291 transitions. [2022-11-23 16:13:56,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:56,344 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 291 transitions. [2022-11-23 16:13:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 16:13:56,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:13:56,344 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:13:56,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-23 16:13:56,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-23 16:13:56,551 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:13:56,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:13:56,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1490105608, now seen corresponding path program 16 times [2022-11-23 16:13:56,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:13:56,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770975396] [2022-11-23 16:13:56,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:13:56,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:13:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:13:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 16:13:56,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:13:56,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770975396] [2022-11-23 16:13:56,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770975396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:13:56,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820066512] [2022-11-23 16:13:56,754 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 16:13:56,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:13:56,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:13:56,756 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:13:56,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-23 16:13:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:13:56,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 16:13:56,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:13:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 16:13:57,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:13:57,219 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 279 treesize of output 215 [2022-11-23 16:13:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 16:13:57,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820066512] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:13:57,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1161649004] [2022-11-23 16:13:57,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:336) 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-23 16:13:57,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:13:57,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-11-23 16:13:57,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887168608] [2022-11-23 16:13:57,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:13:57,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 16:13:57,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:13:57,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 16:13:57,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-11-23 16:13:57,398 INFO L87 Difference]: Start difference. First operand 107 states and 291 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:13:57,582 INFO L93 Difference]: Finished difference Result 141 states and 384 transitions. [2022-11-23 16:13:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 16:13:57,582 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-23 16:13:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:13:57,583 INFO L225 Difference]: With dead ends: 141 [2022-11-23 16:13:57,583 INFO L226 Difference]: Without dead ends: 141 [2022-11-23 16:13:57,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-11-23 16:13:57,584 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:13:57,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:13:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-23 16:13:57,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-11-23 16:13:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.742857142857143) internal successors, (384), 140 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 384 transitions. [2022-11-23 16:13:57,589 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 384 transitions. Word has length 19 [2022-11-23 16:13:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:13:57,589 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 384 transitions. [2022-11-23 16:13:57,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:13:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 384 transitions. [2022-11-23 16:13:57,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 16:13:57,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:13:57,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:13:57,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-23 16:13:57,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-23 16:13:57,797 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:13:57,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:13:57,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1050595456, now seen corresponding path program 17 times [2022-11-23 16:13:57,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:13:57,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946671817] [2022-11-23 16:13:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:13:57,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:13:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:14:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:14:00,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:14:00,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946671817] [2022-11-23 16:14:00,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946671817] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:14:00,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065251895] [2022-11-23 16:14:00,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:14:00,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:14:00,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:14:00,627 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:14:00,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-23 16:14:00,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 16:14:00,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:14:00,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-23 16:14:00,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:14:01,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:14:01,515 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 31 treesize of output 31 [2022-11-23 16:14:01,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:14:01,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:14:01,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:14:01,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 253 treesize of output 174 [2022-11-23 16:14:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:14:02,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:14:06,266 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-23 16:14:06,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1753 treesize of output 1212 [2022-11-23 16:14:06,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:14:06,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1159 treesize of output 1120 [2022-11-23 16:14:06,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:14:06,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1120 treesize of output 1081 [2022-11-23 16:14:06,376 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:14:06,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1081 treesize of output 1018 [2022-11-23 16:14:06,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:14:06,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1018 treesize of output 955 [2022-11-23 16:14:06,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:14:06,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 955 treesize of output 904 [2022-11-23 16:14:06,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:14:06,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 904 treesize of output 853 [2022-11-23 16:14:09,516 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-23 16:14:09,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065251895] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:14:09,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1630381577] [2022-11-23 16:14:09,518 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:336) 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-23 16:14:09,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:14:09,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-11-23 16:14:09,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775915681] [2022-11-23 16:14:09,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:14:09,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-23 16:14:09,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:14:09,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-23 16:14:09,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1293, Unknown=7, NotChecked=0, Total=1482 [2022-11-23 16:14:09,521 INFO L87 Difference]: Start difference. First operand 141 states and 384 transitions. Second operand has 39 states, 38 states have (on average 1.5) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:14:41,169 WARN L233 SmtUtils]: Spent 29.56s on a formula simplification. DAG size of input: 177 DAG size of output: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:15:11,905 WARN L233 SmtUtils]: Spent 29.46s on a formula simplification. DAG size of input: 170 DAG size of output: 163 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:15:23,879 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse32 (* c_~j~0 4))) (let ((.cse14 (+ c_~A~0.offset .cse32))) (let ((.cse34 (select (select |c_#memory_int| c_~A~0.base) .cse14))) (let ((.cse8 (+ c_~bag2~0 .cse34))) (let ((.cse1 (<= (+ 2 c_~j~0) c_~N~0)) (.cse2 (not (<= .cse8 2147483647))) (.cse5 (not (<= 0 (+ c_~bag2~0 .cse34 2147483648)))) (.cse6 (let ((.cse33 (+ c_~bag2~0 .cse34 c_~sum2~0))) (and (<= .cse33 c_~sum1~0) (<= c_~sum1~0 .cse33)))) (.cse7 (not (< c_~j~0 c_~N~0))) (.cse0 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|)) (.cse3 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse4 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))))) (and (<= .cse0 8) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or .cse1 .cse2 .cse5 .cse6 .cse7 (not (< .cse8 c_~cap2~0))) (or (not (= c_~bag2~0 0)) (< .cse0 8) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (let ((.cse12 (+ c_~bag1~0 c_~sum1~0)) (.cse15 (+ c_~A~0.offset .cse32 4)) (.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse19 (<= (+ c_~j~0 3) c_~N~0))) (and (or .cse9 (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse10 (select .cse13 .cse15)) (.cse11 (select .cse13 .cse14))) (or (not (<= (+ .cse10 c_~bag2~0 .cse11) 2147483647)) (not (<= 0 (+ .cse10 c_~bag2~0 .cse11 2147483648))) (not (<= (+ c_~bag2~0 .cse11) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse11 2147483648))) (<= (+ .cse10 c_~bag2~0 .cse11 c_~sum2~0) .cse12))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse15)) (.cse17 (select .cse18 .cse14))) (or (<= .cse12 (+ .cse16 c_~bag2~0 .cse17 c_~sum2~0)) (not (<= (+ .cse16 c_~bag2~0 .cse17) 2147483647)) (not (<= 0 (+ .cse16 c_~bag2~0 .cse17 2147483648))) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse17 2147483648)))))))) .cse19) (or .cse3 .cse4 (and (or .cse9 (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse15)) (.cse21 (select .cse22 .cse14))) (or (not (<= (+ .cse20 .cse21) 2147483647)) (not (<= 0 (+ .cse20 .cse21 2147483648))) (<= .cse12 (+ .cse20 c_~bag2~0 .cse21 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse21 2147483648))) (not (<= (+ c_~bag2~0 .cse21 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse21 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse15)) (.cse24 (select .cse25 .cse14))) (or (not (<= (+ .cse23 .cse24) 2147483647)) (not (<= 0 (+ .cse23 .cse24 2147483648))) (not (<= (+ c_~bag2~0 .cse24) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse24 2147483648))) (<= (+ .cse23 c_~bag2~0 .cse24 c_~sum2~0) .cse12) (not (<= (+ c_~bag2~0 .cse24 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse24 c_~sum2~0 2147483648)))))))) .cse19) (or (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse27 (select .cse28 .cse14)) (.cse26 (select .cse28 .cse15))) (or (not (<= 0 (+ .cse26 .cse27 2147483648))) (<= .cse12 (+ .cse26 c_~bag2~0 .cse27 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse27) 2147483647)) (< c_~bag2~0 (+ .cse26 1)))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse30 (select .cse31 .cse14)) (.cse29 (select .cse31 .cse15))) (or (not (<= 0 (+ .cse29 .cse30 2147483648))) (not (<= (+ c_~bag2~0 .cse30) 2147483647)) (<= (+ .cse29 c_~bag2~0 .cse30 c_~sum2~0) .cse12) (< c_~bag2~0 (+ .cse29 1))))))) .cse9 .cse19))))) (< c_~i~0 c_~N~0)) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|))))))) is different from false [2022-11-23 16:15:53,651 WARN L233 SmtUtils]: Spent 29.62s on a formula simplification. DAG size of input: 180 DAG size of output: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:16:02,228 WARN L233 SmtUtils]: Spent 5.98s on a formula simplification. DAG size of input: 216 DAG size of output: 180 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:16:43,058 WARN L233 SmtUtils]: Spent 29.59s on a formula simplification. DAG size of input: 173 DAG size of output: 166 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:17:13,988 WARN L233 SmtUtils]: Spent 30.01s on a formula simplification. DAG size of input: 184 DAG size of output: 177 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:17:15,287 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse44 (* c_~j~0 4))) (let ((.cse0 (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647))) (.cse1 (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648)))) (.cse7 (+ c_~A~0.offset .cse44 4)) (.cse8 (+ c_~A~0.offset .cse44)) (.cse2 (not (< (+ c_~j~0 1) c_~N~0))) (.cse12 (<= (+ c_~j~0 3) c_~N~0))) (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (< (+ c_~i~0 1) c_~N~0) (let ((.cse5 (+ c_~bag1~0 c_~sum1~0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))))) (and (or .cse0 .cse1 (and (or .cse2 (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse4 (select .cse6 .cse8)) (.cse3 (select .cse6 .cse7))) (or (not (<= 0 (+ .cse3 .cse4 2147483648))) (<= .cse5 (+ .cse3 c_~bag2~0 .cse4 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse4) 2147483647)) (< c_~bag2~0 (+ .cse3 1)))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse8)) (.cse9 (select .cse11 .cse7))) (or (not (<= 0 (+ .cse9 .cse10 2147483648))) (<= (+ .cse9 c_~bag2~0 .cse10 c_~sum2~0) .cse5) (not (<= (+ c_~bag2~0 .cse10) 2147483647)) (< c_~bag2~0 (+ .cse9 1))))))) .cse12) (or .cse2 (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse7)) (.cse14 (select .cse15 .cse8))) (or (not (<= (+ .cse13 .cse14) 2147483647)) (not (<= 0 (+ .cse13 .cse14 2147483648))) (<= (+ .cse13 c_~bag2~0 .cse14 c_~sum2~0) .cse5) (not (<= (+ c_~bag2~0 .cse14) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse14 2147483648))) (not (<= (+ c_~bag2~0 .cse14 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse14 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse7)) (.cse17 (select .cse18 .cse8))) (or (not (<= (+ .cse16 .cse17) 2147483647)) (not (<= 0 (+ .cse16 .cse17 2147483648))) (<= .cse5 (+ .cse16 c_~bag2~0 .cse17 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse17) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse17 2147483648))) (not (<= (+ c_~bag2~0 .cse17 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse17 c_~sum2~0 2147483648)))))))) .cse12))) (or (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse7)) (.cse20 (select .cse21 .cse8))) (or (not (<= (+ .cse19 c_~bag2~0 .cse20) 2147483647)) (not (<= 0 (+ .cse19 c_~bag2~0 .cse20 2147483648))) (<= .cse5 (+ .cse19 c_~bag2~0 .cse20 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse20) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse20 2147483648))))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse22 (select .cse24 .cse7)) (.cse23 (select .cse24 .cse8))) (or (not (<= (+ .cse22 c_~bag2~0 .cse23) 2147483647)) (<= (+ .cse22 c_~bag2~0 .cse23 c_~sum2~0) .cse5) (not (<= 0 (+ .cse22 c_~bag2~0 .cse23 2147483648))) (not (<= (+ c_~bag2~0 .cse23) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse23 2147483648)))))))) .cse2 .cse12)))) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (let ((.cse27 (+ c_~bag1~0 c_~sum1~0))) (and (or .cse2 (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse25 (select .cse28 .cse7)) (.cse26 (select .cse28 .cse8))) (or (not (<= (+ .cse25 c_~bag2~0 .cse26) 2147483647)) (not (<= 0 (+ .cse25 c_~bag2~0 .cse26 2147483648))) (not (<= (+ c_~bag2~0 .cse26) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse26 2147483648))) (<= (+ .cse25 c_~bag2~0 .cse26 c_~sum2~0) .cse27))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse29 (select .cse31 .cse7)) (.cse30 (select .cse31 .cse8))) (or (<= .cse27 (+ .cse29 c_~bag2~0 .cse30 c_~sum2~0)) (not (<= (+ .cse29 c_~bag2~0 .cse30) 2147483647)) (not (<= 0 (+ .cse29 c_~bag2~0 .cse30 2147483648))) (not (<= (+ c_~bag2~0 .cse30) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse30 2147483648)))))))) .cse12) (or .cse0 .cse1 (and (or .cse2 (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse32 (select .cse34 .cse7)) (.cse33 (select .cse34 .cse8))) (or (not (<= (+ .cse32 .cse33) 2147483647)) (not (<= 0 (+ .cse32 .cse33 2147483648))) (<= .cse27 (+ .cse32 c_~bag2~0 .cse33 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse33) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse33 2147483648))) (not (<= (+ c_~bag2~0 .cse33 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse33 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse37 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse35 (select .cse37 .cse7)) (.cse36 (select .cse37 .cse8))) (or (not (<= (+ .cse35 .cse36) 2147483647)) (not (<= 0 (+ .cse35 .cse36 2147483648))) (not (<= (+ c_~bag2~0 .cse36) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse36 2147483648))) (<= (+ .cse35 c_~bag2~0 .cse36 c_~sum2~0) .cse27) (not (<= (+ c_~bag2~0 .cse36 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse36 c_~sum2~0 2147483648)))))))) .cse12) (or (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse39 (select .cse40 .cse8)) (.cse38 (select .cse40 .cse7))) (or (not (<= 0 (+ .cse38 .cse39 2147483648))) (<= .cse27 (+ .cse38 c_~bag2~0 .cse39 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse39) 2147483647)) (< c_~bag2~0 (+ .cse38 1)))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse42 (select .cse43 .cse8)) (.cse41 (select .cse43 .cse7))) (or (not (<= 0 (+ .cse41 .cse42 2147483648))) (not (<= (+ c_~bag2~0 .cse42) 2147483647)) (<= (+ .cse41 c_~bag2~0 .cse42 c_~sum2~0) .cse27) (< c_~bag2~0 (+ .cse41 1))))))) .cse2 .cse12))))) (< c_~i~0 c_~N~0)) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2022-11-23 16:17:16,321 WARN L837 $PredicateComparison]: unable to prove that (and (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (let ((.cse23 (* c_~j~0 4))) (let ((.cse3 (+ c_~bag1~0 c_~sum1~0)) (.cse6 (+ c_~A~0.offset .cse23 4)) (.cse5 (+ c_~A~0.offset .cse23)) (.cse0 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0))) (and (or .cse0 (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse1 (select .cse4 .cse6)) (.cse2 (select .cse4 .cse5))) (or (not (<= (+ .cse1 c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ .cse1 c_~bag2~0 .cse2 2147483648))) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (<= (+ .cse1 c_~bag2~0 .cse2 c_~sum2~0) .cse3))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse6)) (.cse8 (select .cse9 .cse5))) (or (<= .cse3 (+ .cse7 c_~bag2~0 .cse8 c_~sum2~0)) (not (<= (+ .cse7 c_~bag2~0 .cse8) 2147483647)) (not (<= 0 (+ .cse7 c_~bag2~0 .cse8 2147483648))) (not (<= (+ c_~bag2~0 .cse8) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse8 2147483648)))))))) .cse10) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or .cse0 (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse6)) (.cse12 (select .cse13 .cse5))) (or (not (<= (+ .cse11 .cse12) 2147483647)) (not (<= 0 (+ .cse11 .cse12 2147483648))) (<= .cse3 (+ .cse11 c_~bag2~0 .cse12 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse12) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse12 2147483648))) (not (<= (+ c_~bag2~0 .cse12 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse12 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse14 (select .cse16 .cse6)) (.cse15 (select .cse16 .cse5))) (or (not (<= (+ .cse14 .cse15) 2147483647)) (not (<= 0 (+ .cse14 .cse15 2147483648))) (not (<= (+ c_~bag2~0 .cse15) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse15 2147483648))) (<= (+ .cse14 c_~bag2~0 .cse15 c_~sum2~0) .cse3) (not (<= (+ c_~bag2~0 .cse15 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse15 c_~sum2~0 2147483648)))))))) .cse10) (or (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse5)) (.cse17 (select .cse19 .cse6))) (or (not (<= 0 (+ .cse17 .cse18 2147483648))) (<= .cse3 (+ .cse17 c_~bag2~0 .cse18 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (< c_~bag2~0 (+ .cse17 1)))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse5)) (.cse20 (select .cse22 .cse6))) (or (not (<= 0 (+ .cse20 .cse21 2147483648))) (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (<= (+ .cse20 c_~bag2~0 .cse21 c_~sum2~0) .cse3) (< c_~bag2~0 (+ .cse20 1))))))) .cse0 .cse10)))))) (< c_~i~0 c_~N~0)) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|)) is different from false [2022-11-23 16:17:31,317 WARN L233 SmtUtils]: Spent 14.89s on a formula simplification that was a NOOP. DAG size: 168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:17:49,807 WARN L233 SmtUtils]: Spent 9.19s on a formula simplification. DAG size of input: 241 DAG size of output: 196 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:17:58,929 WARN L233 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 226 DAG size of output: 215 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:18:06,276 WARN L233 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 262 DAG size of output: 205 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:18:19,239 WARN L233 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 216 DAG size of output: 209 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:18:34,298 WARN L233 SmtUtils]: Spent 14.89s on a formula simplification that was a NOOP. DAG size: 157 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:18:57,807 WARN L233 SmtUtils]: Spent 23.35s on a formula simplification that was a NOOP. DAG size: 161 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:19:28,291 WARN L233 SmtUtils]: Spent 30.11s on a formula simplification. DAG size of input: 177 DAG size of output: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:19:52,566 WARN L233 SmtUtils]: Spent 18.95s on a formula simplification that was a NOOP. DAG size: 161 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:20:14,991 WARN L233 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 217 DAG size of output: 205 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:20:26,453 WARN L233 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 245 DAG size of output: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:20:26,715 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~j~0 4))) (let ((.cse9 (not (< (+ c_~j~0 1) c_~N~0))) (.cse10 (<= (+ c_~j~0 3) c_~N~0)) (.cse4 (+ c_~A~0.offset .cse23)) (.cse5 (+ c_~A~0.offset .cse23 4)) (.cse0 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|))) (and (<= .cse0 8) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (or (not (<= (+ c_~bag2~0 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 c_~sum2~0 2147483648))) (and (or (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse1 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (not (<= (+ .cse1 .cse2) 2147483647)) (not (<= 0 (+ .cse1 .cse2 2147483648))) (<= (+ .cse1 c_~bag2~0 .cse2 c_~sum2~0) c_~sum1~0) (not (<= (+ c_~bag2~0 .cse2) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 2147483648))) (not (<= (+ c_~bag2~0 .cse2 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse2 c_~sum2~0 2147483648))))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5)) (.cse7 (select .cse8 .cse4))) (or (not (<= (+ .cse6 .cse7) 2147483647)) (not (<= 0 (+ .cse6 .cse7 2147483648))) (<= c_~sum1~0 (+ .cse6 c_~bag2~0 .cse7 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse7) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse7 2147483648))) (not (<= (+ c_~bag2~0 .cse7 c_~sum2~0) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse7 c_~sum2~0 2147483648)))))))) .cse9 .cse10) (or (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse4)) (.cse11 (select .cse13 .cse5))) (or (not (<= 0 (+ .cse11 .cse12 2147483648))) (<= c_~sum1~0 (+ .cse11 c_~bag2~0 .cse12 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse12) 2147483647)) (< c_~bag2~0 (+ .cse11 1)))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse4)) (.cse14 (select .cse16 .cse5))) (or (not (<= 0 (+ .cse14 .cse15 2147483648))) (<= (+ .cse14 c_~bag2~0 .cse15 c_~sum2~0) c_~sum1~0) (not (<= (+ c_~bag2~0 .cse15) 2147483647)) (< c_~bag2~0 (+ .cse14 1))))))) .cse9 .cse10))) (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or .cse9 .cse10 (and (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse17 (select .cse19 .cse5)) (.cse18 (select .cse19 .cse4))) (or (not (<= (+ .cse17 c_~bag2~0 .cse18) 2147483647)) (not (<= 0 (+ .cse17 c_~bag2~0 .cse18 2147483648))) (<= (+ .cse17 c_~bag2~0 .cse18 c_~sum2~0) c_~sum1~0) (not (<= (+ c_~bag2~0 .cse18) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse18 2147483648))))))) (forall ((v_ArrVal_764 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_764) c_~A~0.base))) (let ((.cse20 (select .cse22 .cse5)) (.cse21 (select .cse22 .cse4))) (or (not (<= (+ .cse20 c_~bag2~0 .cse21) 2147483647)) (not (<= 0 (+ .cse20 c_~bag2~0 .cse21 2147483648))) (<= c_~sum1~0 (+ .cse20 c_~bag2~0 .cse21 c_~sum2~0)) (not (<= (+ c_~bag2~0 .cse21) 2147483647)) (not (<= 0 (+ c_~bag2~0 .cse21 2147483648))))))))) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (= c_~bag2~0 0)) (< .cse0 8) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_main_~#t2~0#1.base|)))) is different from false [2022-11-23 16:20:38,557 WARN L233 SmtUtils]: Spent 8.85s on a formula simplification. DAG size of input: 243 DAG size of output: 236 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:21:02,061 WARN L233 SmtUtils]: Spent 20.77s on a formula simplification that was a NOOP. DAG size: 150 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:21:12,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 16:21:20,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 16:21:38,531 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 220 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 16:21:40,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 16:21:45,300 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-23 16:21:45,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-11-23 16:21:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-11-23 16:21:45,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 161 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8970 ImplicationChecksByTransitivity, 444.0s TimeCoverageRelationStatistics Valid=4046, Invalid=20934, Unknown=158, NotChecked=1268, Total=26406 [2022-11-23 16:21:45,304 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1078 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 418 mSolverCounterUnsat, 50 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 50 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:21:45,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 0 Invalid, 2783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 2257 Invalid, 50 Unknown, 58 Unchecked, 14.2s Time] [2022-11-23 16:21:45,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-23 16:21:45,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-23 16:21:45,508 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 55 more [2022-11-23 16:21:45,509 INFO L158 Benchmark]: Toolchain (without parser) took 802566.21ms. Allocated memory was 113.2MB in the beginning and 469.8MB in the end (delta: 356.5MB). Free memory was 71.6MB in the beginning and 340.2MB in the end (delta: -268.7MB). Peak memory consumption was 90.9MB. Max. memory is 16.1GB. [2022-11-23 16:21:45,509 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory was 81.6MB in the beginning and 81.5MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 16:21:45,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.39ms. Allocated memory is still 113.2MB. Free memory was 71.6MB in the beginning and 59.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 16:21:45,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.67ms. Allocated memory is still 113.2MB. Free memory was 59.4MB in the beginning and 56.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 16:21:45,510 INFO L158 Benchmark]: Boogie Preprocessor took 70.39ms. Allocated memory was 113.2MB in the beginning and 155.2MB in the end (delta: 41.9MB). Free memory was 56.9MB in the beginning and 127.9MB in the end (delta: -71.0MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2022-11-23 16:21:45,510 INFO L158 Benchmark]: RCFGBuilder took 1005.23ms. Allocated memory is still 155.2MB. Free memory was 127.9MB in the beginning and 102.4MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 16:21:45,511 INFO L158 Benchmark]: TraceAbstraction took 801109.21ms. Allocated memory was 155.2MB in the beginning and 469.8MB in the end (delta: 314.6MB). Free memory was 101.7MB in the beginning and 340.2MB in the end (delta: -238.6MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2022-11-23 16:21:45,512 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory was 81.6MB in the beginning and 81.5MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.39ms. Allocated memory is still 113.2MB. Free memory was 71.6MB in the beginning and 59.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.67ms. Allocated memory is still 113.2MB. Free memory was 59.4MB in the beginning and 56.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.39ms. Allocated memory was 113.2MB in the beginning and 155.2MB in the end (delta: 41.9MB). Free memory was 56.9MB in the beginning and 127.9MB in the end (delta: -71.0MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1005.23ms. Allocated memory is still 155.2MB. Free memory was 127.9MB in the beginning and 102.4MB in the end (delta: 25.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 801109.21ms. Allocated memory was 155.2MB in the beginning and 469.8MB in the end (delta: 314.6MB). Free memory was 101.7MB in the beginning and 340.2MB in the end (delta: -238.6MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.1s, 375 PlacesBefore, 24 PlacesAfterwards, 396 TransitionsBefore, 21 TransitionsAfterwards, 37700 CoEnabledTransitionPairs, 8 FixpointIterations, 117 TrivialSequentialCompositions, 251 ConcurrentSequentialCompositions, 15 TrivialYvCompositions, 78 ConcurrentYvCompositions, 24 ChoiceCompositions, 485 TotalNumberOfCompositions, 31579 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31135, independent: 31096, independent conditional: 0, independent unconditional: 31096, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27545, independent: 27526, independent conditional: 0, independent unconditional: 27526, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27545, independent: 27526, independent conditional: 0, independent unconditional: 27526, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31135, independent: 3570, independent conditional: 0, independent unconditional: 3570, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 27545, unknown conditional: 0, unknown unconditional: 27545] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 16:21:47,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 16:21:47,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 16:21:47,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 16:21:47,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 16:21:47,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 16:21:47,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 16:21:47,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 16:21:47,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 16:21:47,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 16:21:47,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 16:21:47,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 16:21:47,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 16:21:47,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 16:21:47,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 16:21:47,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 16:21:47,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 16:21:47,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 16:21:47,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 16:21:47,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 16:21:47,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 16:21:47,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 16:21:47,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 16:21:47,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 16:21:47,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 16:21:47,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 16:21:47,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 16:21:47,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 16:21:47,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 16:21:47,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 16:21:47,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 16:21:47,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 16:21:47,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 16:21:47,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 16:21:47,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 16:21:47,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 16:21:47,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 16:21:47,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 16:21:47,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 16:21:47,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 16:21:47,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 16:21:47,926 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-23 16:21:47,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 16:21:47,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 16:21:47,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 16:21:47,969 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 16:21:47,970 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 16:21:47,970 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 16:21:47,970 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 16:21:47,970 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 16:21:47,971 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 16:21:47,971 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 16:21:47,972 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 16:21:47,972 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 16:21:47,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 16:21:47,974 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 16:21:47,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 16:21:47,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 16:21:47,974 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 16:21:47,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 16:21:47,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 16:21:47,975 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 16:21:47,976 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 16:21:47,976 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 16:21:47,976 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 16:21:47,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 16:21:47,977 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 16:21:47,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 16:21:47,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 16:21:47,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 16:21:47,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 16:21:47,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:21:47,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 16:21:47,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 16:21:47,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 16:21:47,980 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 16:21:47,980 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 16:21:47,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 16:21:47,981 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 16:21:47,981 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 16:21:47,981 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c870162e8691a06e8bb6a8083be9eaf3f7ddc94357fb302a6e1fdd1b7aa873f8 [2022-11-23 16:21:48,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 16:21:48,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 16:21:48,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 16:21:48,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 16:21:48,366 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 16:21:48,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-11-23 16:21:51,462 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 16:21:51,708 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 16:21:51,708 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2022-11-23 16:21:51,715 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/data/5412f4ef0/10ae7a41551f4775b82c4c8af3d9d526/FLAG20c7db2c4 [2022-11-23 16:21:51,727 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/data/5412f4ef0/10ae7a41551f4775b82c4c8af3d9d526 [2022-11-23 16:21:51,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 16:21:51,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 16:21:51,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 16:21:51,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 16:21:51,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 16:21:51,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:21:51" (1/1) ... [2022-11-23 16:21:51,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78935c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:51, skipping insertion in model container [2022-11-23 16:21:51,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:21:51" (1/1) ... [2022-11-23 16:21:51,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 16:21:51,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 16:21:52,031 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_9fef534e-4450-433b-9fc0-0fc270b2dcf9/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-23 16:21:52,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:21:52,082 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-23 16:21:52,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 16:21:52,124 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_9fef534e-4450-433b-9fc0-0fc270b2dcf9/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-23 16:21:52,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:21:52,143 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 16:21:52,184 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_9fef534e-4450-433b-9fc0-0fc270b2dcf9/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c[2755,2768] [2022-11-23 16:21:52,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:21:52,214 INFO L208 MainTranslator]: Completed translation [2022-11-23 16:21:52,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52 WrapperNode [2022-11-23 16:21:52,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 16:21:52,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 16:21:52,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 16:21:52,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 16:21:52,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52" (1/1) ... [2022-11-23 16:21:52,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52" (1/1) ... [2022-11-23 16:21:52,299 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 259 [2022-11-23 16:21:52,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 16:21:52,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 16:21:52,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 16:21:52,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 16:21:52,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52" (1/1) ... [2022-11-23 16:21:52,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52" (1/1) ... [2022-11-23 16:21:52,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52" (1/1) ... [2022-11-23 16:21:52,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52" (1/1) ... [2022-11-23 16:21:52,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52" (1/1) ... [2022-11-23 16:21:52,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52" (1/1) ... [2022-11-23 16:21:52,390 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52" (1/1) ... [2022-11-23 16:21:52,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52" (1/1) ... [2022-11-23 16:21:52,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 16:21:52,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 16:21:52,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 16:21:52,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 16:21:52,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52" (1/1) ... [2022-11-23 16:21:52,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:21:52,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:21:52,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 16:21:52,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 16:21:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 16:21:52,490 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-23 16:21:52,490 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-23 16:21:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-23 16:21:52,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-23 16:21:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 16:21:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 16:21:52,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 16:21:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 16:21:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 16:21:52,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 16:21:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 16:21:52,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 16:21:52,494 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 16:21:52,656 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 16:21:52,658 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 16:21:53,292 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 16:21:53,304 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 16:21:53,305 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-23 16:21:53,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:21:53 BoogieIcfgContainer [2022-11-23 16:21:53,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 16:21:53,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 16:21:53,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 16:21:53,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 16:21:53,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:21:51" (1/3) ... [2022-11-23 16:21:53,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12abcc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:21:53, skipping insertion in model container [2022-11-23 16:21:53,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:21:52" (2/3) ... [2022-11-23 16:21:53,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12abcc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:21:53, skipping insertion in model container [2022-11-23 16:21:53,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:21:53" (3/3) ... [2022-11-23 16:21:53,315 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2022-11-23 16:21:53,324 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 16:21:53,333 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 16:21:53,333 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 16:21:53,333 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 16:21:53,624 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 16:21:53,697 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 16:21:53,717 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 378 transitions, 772 flow [2022-11-23 16:21:53,723 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 378 transitions, 772 flow [2022-11-23 16:21:53,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 378 transitions, 772 flow [2022-11-23 16:21:53,901 INFO L130 PetriNetUnfolder]: 28/376 cut-off events. [2022-11-23 16:21:53,902 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 16:21:53,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 376 events. 28/376 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 901 event pairs, 0 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 263. Up to 2 conditions per place. [2022-11-23 16:21:53,939 INFO L119 LiptonReduction]: Number of co-enabled transitions 35532 [2022-11-23 16:22:27,677 INFO L134 LiptonReduction]: Checked pairs total: 30485 [2022-11-23 16:22:27,677 INFO L136 LiptonReduction]: Total number of compositions: 465 [2022-11-23 16:22:27,685 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 58 flow [2022-11-23 16:22:27,699 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:22:27,715 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 16:22:27,721 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;@3ca74098, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 16:22:27,722 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-23 16:22:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:22:27,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 16:22:27,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:22:27,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:22:27,731 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:22:27,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:22:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1212750225, now seen corresponding path program 1 times [2022-11-23 16:22:27,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:22:27,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282178684] [2022-11-23 16:22:27,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:22:27,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:22:27,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:22:27,756 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:22:27,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-23 16:22:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:22:27,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 16:22:27,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:22:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:22:28,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:22:28,198 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:22:28,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282178684] [2022-11-23 16:22:28,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282178684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:22:28,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:22:28,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 16:22:28,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164941164] [2022-11-23 16:22:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:22:28,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:22:28,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:22:28,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:22:28,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:22:28,235 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 32 states have internal predecessors, (76), 0 states have call successors, (0), 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 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:22:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:22:28,615 INFO L93 Difference]: Finished difference Result 90 states and 237 transitions. [2022-11-23 16:22:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:22:28,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 16:22:28,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:22:28,627 INFO L225 Difference]: With dead ends: 90 [2022-11-23 16:22:28,627 INFO L226 Difference]: Without dead ends: 85 [2022-11-23 16:22:28,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:22:28,631 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 16:22:28,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 16:22:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-23 16:22:28,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 45. [2022-11-23 16:22:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.477272727272727) internal successors, (109), 44 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:22:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 109 transitions. [2022-11-23 16:22:28,668 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 109 transitions. Word has length 12 [2022-11-23 16:22:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:22:28,669 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 109 transitions. [2022-11-23 16:22:28,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:22:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 109 transitions. [2022-11-23 16:22:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 16:22:28,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:22:28,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:22:28,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-23 16:22:28,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:22:28,883 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:22:28,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:22:28,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2073881093, now seen corresponding path program 1 times [2022-11-23 16:22:28,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:22:28,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427532515] [2022-11-23 16:22:28,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:22:28,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:22:28,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:22:28,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:22:28,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-23 16:22:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:22:29,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 16:22:29,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:22:29,395 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-23 16:22:29,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 16:22:29,396 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 16:22:29,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427532515] [2022-11-23 16:22:29,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427532515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:22:29,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:22:29,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 16:22:29,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702405199] [2022-11-23 16:22:29,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:22:29,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:22:29,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 16:22:29,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:22:29,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 16:22:29,404 INFO L87 Difference]: Start difference. First operand 45 states and 109 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:22:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:22:29,771 INFO L93 Difference]: Finished difference Result 69 states and 147 transitions. [2022-11-23 16:22:29,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 16:22:29,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 16:22:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:22:29,773 INFO L225 Difference]: With dead ends: 69 [2022-11-23 16:22:29,773 INFO L226 Difference]: Without dead ends: 61 [2022-11-23 16:22:29,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-23 16:22:29,776 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 16:22:29,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 16:22:29,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-23 16:22:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 37. [2022-11-23 16:22:29,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 2.4722222222222223) internal successors, (89), 36 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:22:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 89 transitions. [2022-11-23 16:22:29,783 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 89 transitions. Word has length 13 [2022-11-23 16:22:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:22:29,786 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 89 transitions. [2022-11-23 16:22:29,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:22:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 89 transitions. [2022-11-23 16:22:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 16:22:29,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:22:29,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:22:29,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-23 16:22:30,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:22:30,001 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-23 16:22:30,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:22:30,001 INFO L85 PathProgramCache]: Analyzing trace with hash 734275961, now seen corresponding path program 2 times [2022-11-23 16:22:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 16:22:30,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854044059] [2022-11-23 16:22:30,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 16:22:30,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 16:22:30,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 16:22:30,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-23 16:22:30,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fef534e-4450-433b-9fc0-0fc270b2dcf9/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process